|
Search: id:A081356
|
|
|
| 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. |
|
+0
7
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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)]
|
|
EXAMPLE
|
a(4)=33, as A081355(33)=LD(33,33^2)=LD(33,1089)=4 and A081355(m)<4 for m<=33.
|
|
CROSSREFS
|
Adjacent sequences: A081353 A081354 A081355 this_sequence A081357 A081358 A081359
Sequence in context: A006276 A103051 A095018 this_sequence A018269 A096122 A082614
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 18 2003
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 01 2004
|
|
|
Search completed in 0.002 seconds
|
