id:A097721 - OEIS Search Results

Search: id:A097721

Displaying 1-1 of 1 results found.

page 1

Smallest prime that differs from prime(n) in decimal representation by exactly one editing operation: deletion, insertion, or substitution.

+0
3

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; listen)

	OFFSET	`1,1`
	COMMENT	`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	`Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane (njas(AT)research.att.com)]`
	CROSSREFS	`Cf. A097720.` `Sequence in context: A134653 A090207 A065437 this_sequence A073756 A006379 A105198` `Adjacent sequences: A097718 A097719 A097720 this_sequence A097722 A097723 A097724`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2004`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research