|
%I #7 Mar 30 2012 18:50:45
%S 3,2,2,2,13,3,7,11,2,2,3,3,11,3,7,3,5,11,7,7,3,7,3,19,7,11,13,17,19,
%T 11,17,11,13,13,19,11,17,13,17,13,17,11,11,13,17,19,11,23,127,29,23,
%U 23,41,151,157,23,29,71,227,181,23,23,37,11,13,17,31,37,37,149,53,59,37,37,37
%N Smallest prime that differs from prime(n) in decimal representation by exactly one editing operation: deletion, insertion, or substitution.
%C a(n) = Min{p prime: LevenshteinDistance(p, A000040(n))=1};
%C except for n=1 and n=5: a(n) < A000040(n);
%C a(n) < A097722(n).
%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. A097720.
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Aug 23 2004
|
