id:A086694 - OEIS Search Results

Search: id:A086694

Displaying 1-1 of 1 results found.

page 1

A run of 2^n 1's followed by a run of 2^n 0's, for n=0, 1, 2, ...

+0
2

1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(n) = 1-A079944(n-1) = 2-A079882(n-1) = A080791(n+1)-A083661(n+1).` `First differences of A006165 and, likely, of A078881.`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`1 - floor(log2(4*(n+1)/3)) + floor(log2(n+1)).` `a(1) = 1, a(2) = 0, a(2n+1) = a(n), a(2n) = a(n-1).`
	PROGRAM	`(PARI) a(n)=if(n<3, if(n<2, 1, 0), if(n%2==0, a(n/2-1), a((n-1)/2)))`
	CROSSREFS	`Cf. A005942, A079944.` `Sequence in context: A070829 A118175 A120526 this_sequence A093317 A127253 A117944` `Adjacent sequences: A086691 A086692 A086693 this_sequence A086695 A086696 A086697`
	KEYWORD	`nonn,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), Sep 12 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research