id:A091829 - OEIS Search Results

Search: id:A091829

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 2, 1, 3, 0, 2, 1, 4, 1, 1, 0, 3, 0, 2, 1, 5, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 6, 1, 1, 0, 3, 0, 2, 1, 3, 0, 2, 1, 2, 1, 1, 0, 5, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 7, 0, 2, 1, 2, 1, 1, 0, 4, 1, 1, 0, 3, 0, 2, 1, 4, 1, 1, 0, 3, 0, 2, 1, 3, 0, 2, 1, 2, 1, 1, 0, 6, 1, 1, 0, 3, 0, 2, 1, 3, 0 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`n>0 a(2*A059009(n)+1)=0; n>0 a(n) mod 2 = 1-A059448(n); a(2^n)=n+1`
	PROGRAM	`(PARI) a(n)=if(n<2, 1, if(n%2, (a(n-1)+1)%2, a(n/2)+1))`
	CROSSREFS	`Sequence in context: A071467 A125073 A071461 this_sequence A104512 A131848 A035157` `Adjacent sequences: A091826 A091827 A091828 this_sequence A091830 A091831 A091832`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 09 2004`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research