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!)
 A091092 In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2. 4
 0, 0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 5, 5, 5, 6, 6, 6, 7, 7, 6, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 6, 7, 7, 6, 6, 6, 6, 6, 7, 7, 7, 7, 6, 7, 8, 8, 7, 8, 8, 7, 7, 7, 7, 7, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS a(n) = A152487(A000290(n),n). - Reinhard Zumkeller, Dec 06 2008 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..20000 Eric Weisstein's World of Mathematics, Square Number Eric Weisstein's World of Mathematics, Binary Wikipedia, Levenshtein Distance FORMULA a(n) = LevenshteinDistance(A007088(n), A001737(n)). EXAMPLE a(7)=3: 7->'111', 3 x insert a 0 between the last two 1's: '110001'->49=7^2. CROSSREFS Cf. A091093, A091091, A070939, A000290. Sequence in context: A316844 A331245 A130239 * A218461 A186189 A083375 Adjacent sequences:  A091089 A091090 A091091 * A091093 A091094 A091095 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Dec 18 2003 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 June 12 13:21 EDT 2021. Contains 344947 sequences. (Running on oeis4.)