A056978 - OEIS

This site is supported by donations to The OEIS Foundation.

A056978

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

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,36`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	FORMULA	`a(2n) = a(n) + [n congruent to 2 mod 4], a(2n+1) = a(n). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 22 2003`
	CROSSREFS	`Cf. A014082, A056974, A056975, A056976, A056977, A056978, A056979, A056980.` `Sequence in context: A165105 A055641 A086075 * A037819 A090405 A168509` `Adjacent sequences: A056975 A056976 A056977 * A056979 A056980 A056981`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:48 EST 2012. Contains 205939 sequences.