id:A091952 - OEIS Search Results

Search: id:A091952

Displaying 1-1 of 1 results found.

page 1

A091952

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

+0
1

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

	OFFSET	`1,5`
	FORMULA	`a(6n)=A035263(n)`
	PROGRAM	`(PARI) a(n)=if(n<2, 1, if(n%2, 2*a(n-1), (a(n/2)+1)%2))`
	CROSSREFS	`Sequence in context: A161491 A030203 A101664 this_sequence A108803 A050601 A101650` `Adjacent sequences: A091949 A091950 A091951 this_sequence A091953 A091954 A091955`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 2004`

page 1

Search completed in 0.002 seconds

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.

AT&T Labs Research