A106028 Minimal number of editing steps (delete, insert or substitute) to transform the binary representation of n into that of A003714(n), the n-th fibbinary number.

0, 0, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 4, 4, 4, 1, 1, 2, 2, 1, 4, 4, 4, 3, 3, 3, 3, 3, 4, 4, 4, 2, 2, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 5, 2, 2, 2, 2, 2, 2, 2, 7, 5, 5, 5, 5, 5, 5, 5, 7, 2, 2, 2, 2, 3, 3, 3, 4, 2, 3, 2, 2, 4, 4, 4, 5, 2, 3, 2, 2, 2, 2, 2, 3, 3, 6, 6, 6, 5, 5, 6, 6, 4, 5, 4, 4, 4, 4, 5, 5, 4, 4

Offset: 1

Author

Reinhard Zumkeller, May 05 2005

Keywords

• nonn

Comments

A014417(n) = A007088(A003714(n)).

Links

• Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - _N. J. A. Sloane_]
• Eric Weisstein's World of Mathematics, Zeckendorf Representation
• Index entries for sequences related to binary expansion of n

Crossrefs

Cf. A035517, A000045, A072649, A070939.

Formula

a(n) = LevenshteinDistance(A014417(n), A007088(n)).