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”).

A081356
Least m such that A081355(m)=LD(m,m^2)=n, where LD(x,y) denotes the Levenshtein distance between x and y in decimal representation.
6
0, 2, 4, 17, 33, 144, 317, 1439, 3167, 14144, 31624, 141442, 316229, 1414234, 3162922, 14142148, 31622888, 141422444, 316292397, 1414213838, 3162353552, 14142137977, 31622912229, 141421462429, 316228884988, 1414214626248
OFFSET
0,2
LINKS
Michael Gilleland, Levenshtein Distance. [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane]
EXAMPLE
a(4)=33, as A081355(33)=LD(33,33^2)=LD(33,1089)=4 and A081355(m)<4 for m<=33.
CROSSREFS
Sequence in context: A317488 A103051 A095018 * A018269 A270359 A276557
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Mar 18 2003
EXTENSIONS
More terms from David Wasserman, Jun 01 2004
STATUS
approved