id:A056973 - OEIS Search Results

Search: id:A056973

Displaying 1-1 of 1 results found.

page 1

Number of blocks of {0,0} in the binary expansion of n.

+0
5

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

	OFFSET	`1,8`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	FORMULA	`a(2n) = a(n) + [n is even], a(2n+1) = a(n).` `G.f.: 1/(1-x) * sum(k>=0, t^4/(1+t)/(1+t^2), t=x^2^k). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 10 2003` `a(n) = A023416(n) - A033264(n). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 10 2003`
	CROSSREFS	`Cf. A014081, A033264, A037800.` `Sequence in context: A066301 A046660 A108730 this_sequence A107782 A086017 A000161` `Adjacent sequences: A056970 A056971 A056972 this_sequence A056974 A056975 A056976`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research