id:A091090 - OEIS Search Results

Search: id:A091090

Displaying 1-1 of 1 results found.

page 1

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

+0
9

1, 1, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 5, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 1, 6, 1, 2, 1, 3, 1, 2 (list; graph; listen)

	OFFSET	`0,4`
	COMMENT	`a(n) = A007814(n+1) + 1 - A036987(n).` `a(n) = A152487(n+1,n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 06 2008]`
	LINKS	`Michael Gilleland, Levenshtein Distance [It has been suggested that this algorithm gives incorrect results sometimes. - N. J. A. Sloane (njas(AT)research.att.com)]` `Eric Weisstein's World of Mathematics, Binary` `Eric Weisstein's World of Mathematics, Binary Carry Sequence` `Index entries for sequences related to binary expansion of n`
	FORMULA	`LevenshteinDistance(A007088(n), A007088(n+1)).` `a(2n)=1, a(2n+1)=a(n)+1. G.f.: Sum_{k>0} x^(2^k-1)/(1-x^(2^(k-1))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 25 2004`
	CROSSREFS	`Cf. A007088.` `This is Guy Steele's sequence GS(2, 4) (see A135416).` `Sequence in context: A055874 A161506 A066451 this_sequence A066075 A072347 A136107` `Adjacent sequences: A091087 A091088 A091089 this_sequence A091091 A091092 A091093`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 19 2003`

page 1

Search completed in 0.002 seconds

Last modified December 23 15:34 EST 2009. Contains 171084 sequences.

AT&T Labs Research