A091959 a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2*a(2n)+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

Offset

0,5

Comments

If we replace 3's by 1's we get A035263.

Links

Table of n, a(n) for n=0..104.

Formula

a(A036554(n))=0; a(2*A036554(n)+1)=3 otherwise a(n)=1

Prog

(PARI) a(n)=if(n<2, 1, if(n%2, 2*a(n-1)+1, (a(n/2)+1)%2))

Crossrefs

Sequence in context: A140807 A232629 A340007 * A318659 A318513 A354058

Adjacent sequences: A091956 A091957 A091958 * A091960 A091961 A091962

Keyword

nonn

Author

Benoit Cloitre, Mar 13 2004

Status

approved