id:A106028 - OEIS Search Results

Search: id:A106028

Displaying 1-1 of 1 results found.

page 1

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
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; listen)

	OFFSET	`1,3`
	COMMENT	`A014417(n) = A007088(A003714(n)).`
	LINKS	`Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - njas]` `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: A104605 A138516 A026513 this_sequence A105307 A082070 A082071` `Adjacent sequences: A106025 A106026 A106027 this_sequence A106029 A106030 A106031`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 05 2005`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research