id:A091959 - OEIS Search Results

Search: id:A091959

Displaying 1-1 of 1 results found.

page 1

A091959

a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2*a(2n)+1.

+0
1

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

	OFFSET	`0,5`
	COMMENT	`If we replace 3's by 1's we get A035263.`
	FORMULA	`a(A036554(n))=0; a(2*A036554(n)+1)=3 otherwise a(n)=1`
	PROGRAM	`(PARI) a(n)=if(n<2, 1, if(n%2, 2*a(n-1)+1, (a(n/2)+1)%2))`
	CROSSREFS	`Sequence in context: A035676 A129685 A140807 this_sequence A046094 A055976 A093684` `Adjacent sequences: A091956 A091957 A091958 this_sequence A091960 A091961 A091962`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 13 2004`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research