|
%I #7 Mar 30 2012 18:50:45
%S 5,11,5,11,17,19,18,19,16,12,13,17,16,15,15,16,13,15,15,14,16,15,16,
%T 10,15,26,19,18,27,20,20,24,21,17,18,18,19,18,23,20,20,17,20,21,25,20,
%U 20,18,17,19,16,19,16,15,17,18,16,20,17,16,22,18,18,19,14,20,16,19,20,14
%N Number of primes that differ from n-th prime in decimal representation by exactly one edit-operation: deletion, insertion, or substitution.
%C a(n) = #{p prime: LevenshteinDistance(p, A000040(n))=1}.
%H Michael Gilleland, <a href="http://www.merriampark.com/ld.htm">Levenshtein Distance</a> [It has been suggested that this algorithm gives incorrect results sometimes. - _N. J. A. Sloane_]
%Y Cf. A080910, A097721, A097722.
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Aug 23 2004
|
