OFFSET
0,1
LINKS
Michael Gilleland, Levenshtein Distance
Wikipedia, Levenshtein Distance
FORMULA
PROG
(Python)
from Levenshtein import distance # after pip install python-Levenshtein
from sympy import nextprime
def a(n):
m = 0
while True:
b = bin(m)[2:]
if distance(b, bin(nextprime(m-1))[2:]) == n:
return m
m += 1
print([a(n) for n in range(1, 16)]) # Michael S. Branicky, Feb 05 2022
CROSSREFS
KEYWORD
nonn,base,more
AUTHOR
Reinhard Zumkeller, Dec 08 2009
EXTENSIONS
a(10)-a(26) from Michael S. Branicky, Feb 05 2022
a(27)-a(29) from Michael S. Branicky, Feb 06 2022
a(30)-a(31) from Michael S. Branicky, Feb 19 2022
STATUS
approved