A056980 - OEIS

This site is supported by donations to The OEIS Foundation.

A056980

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

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

	OFFSET	`1,54`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	FORMULA	`a(2n) = a(n) + [n congruent to 3 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: A172090 A176048 A037912 * A005094 A121372 A123706` `Adjacent sequences: A056977 A056978 A056979 * A056981 A056982 A056983`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

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

Last modified February 17 20:50 EST 2012. Contains 206085 sequences.