login
This site is supported by donations to The OEIS Foundation.
Logo

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. 3
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; internal format)
OFFSET

0,4

COMMENTS

a(n) = A152487(A000290(n),n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 06 2008]

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)]

Index entries for sequences related to binary expansion of n

Eric Weisstein's World of Mathematics, Square Number

Eric Weisstein's World of Mathematics, Binary

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: A074795 A069577 A130239 * A186189 A083375 A088519

Adjacent sequences:  A091089 A091090 A091091 * A091093 A091094 A091095

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 18 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.