A091092 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A091092

In binary representation: minimal number of editing steps (delete, insert or substitute) to transform n into n^2.

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

Index entries for sequences related to binary expansion of n

FORMULA