login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A097720
Number of primes that differ from n-th prime in decimal representation by exactly one edit-operation: deletion, insertion, or substitution.
2
5, 11, 5, 11, 17, 19, 18, 19, 16, 12, 13, 17, 16, 15, 15, 16, 13, 15, 15, 14, 16, 15, 16, 10, 15, 26, 19, 18, 27, 20, 20, 24, 21, 17, 18, 18, 19, 18, 23, 20, 20, 17, 20, 21, 25, 20, 20, 18, 17, 19, 16, 19, 16, 15, 17, 18, 16, 20, 17, 16, 22, 18, 18, 19, 14, 20, 16, 19, 20, 14
OFFSET
1,1
COMMENTS
a(n) = #{p prime: LevenshteinDistance(p, A000040(n))=1}.
LINKS
Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane]
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Aug 23 2004
STATUS
approved