This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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 FORMULA a(n) = LevenshteinDistance(A014417(n), A007088(n)). CROSSREFS Cf. A035517, A000045, A072649, A070939. Sequence in context: A138516 A180580 A026513 * A105307 A281012 A304943 Adjacent sequences:  A106025 A106026 A106027 * A106029 A106030 A106031 KEYWORD nonn AUTHOR Reinhard Zumkeller, May 05 2005 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 January 21 13:23 EST 2019. Contains 319350 sequences. (Running on oeis4.)