id:A056980 - OEIS Search Results

Search: id:A056980

Displaying 1-1 of 1 results found.

page 1

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

+0
10

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; listen)

	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: A037821 A037911 A037912 this_sequence A005094 A121372 A123706` `Adjacent sequences: A056977 A056978 A056979 this_sequence A056981 A056982 A056983`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.

AT&T Labs Research