login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097721 Smallest prime that differs from prime(n) in decimal representation by exactly one editing operation: deletion, insertion, or substitution. 2
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, 11, 17, 11, 13, 13, 19, 11, 17, 13, 17, 13, 17, 11, 11, 13, 17, 19, 11, 23, 127, 29, 23, 23, 41, 151, 157, 23, 29, 71, 227, 181, 23, 23, 37, 11, 13, 17, 31, 37, 37, 149, 53, 59, 37, 37, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = Min{p prime: LevenshteinDistance(p, A000040(n))=1};

except for n=1 and n=5: a(n) < A000040(n);

a(n) < A097722(n).

LINKS

Table of n, a(n) for n=1..75.

Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane]

CROSSREFS

Cf. A097720.

Sequence in context: A202538 A239736 A065437 * A073756 A328829 A006379

Adjacent sequences:  A097718 A097719 A097720 * A097722 A097723 A097724

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Aug 23 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 06:34 EST 2019. Contains 329784 sequences. (Running on oeis4.)