The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 Adjacent sequences:  A081353 A081354 A081355 * A081357 A081358 A081359 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Mar 18 2003 EXTENSIONS More terms from David Wasserman, Jun 01 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.

Last modified September 25 00:02 EDT 2020. Contains 337333 sequences. (Running on oeis4.)