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,3

Comments

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

Links

Table of n, a(n) for n=1..105.

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

Formula

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

Crossrefs

Cf. A035517, A000045, A072649, A070939.

Sequence in context: A180580 A026513 A349497 * A105307 A281012 A347342

Adjacent sequences: A106025 A106026 A106027 * A106029 A106030 A106031

Keyword

nonn

Author

Reinhard Zumkeller, May 05 2005

Status

approved