A091829 - OEIS

This site is supported by donations to The OEIS Foundation.

A091829

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

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; refs; listen; history; internal format)

	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`
	PROG	`(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 * A194188 A104512 A131848` `Adjacent sequences: A091826 A091827 A091828 * A091830 A091831 A091832`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 09 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.