login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091952 a(1)=1, a(2n)=(a(n)+1) mod 2; a(2n+1)=2*a(2n). 1

%I

%S 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,

%T 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,

%U 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

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

%F a(6n)=A035263(n)

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

%Y A245187 is a very similar sequence.

%K nonn

%O 1,5

%A _Benoit Cloitre_, Mar 11 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 01:23 EDT 2020. Contains 333195 sequences. (Running on oeis4.)