A091959 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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