A056975 - OEIS

This site is supported by donations to The OEIS Foundation.

A056975

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

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

	OFFSET	`1,73`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	FORMULA	`a(2n) = a(n), a(2n+1) = a(n) + [n congruent to 0 mod 4]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Aug 22 2003`
	CROSSREFS	`Cf. A014082, A056974, A056975, A056976, A056977, A056978, A056979, A056980.` `Sequence in context: A076493 A037910 A162781 * A114117 A144435 A173120` `Adjacent sequences: A056972 A056973 A056974 * A056976 A056977 A056978`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

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

Last modified February 14 01:35 EST 2012. Contains 205567 sequences.