login
The OEIS is supported by the many generous donors to the OEIS 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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(6n)=A035263(n)
PROG
(PARI) a(n)=if(n<2, 1, if(n%2, 2*a(n-1), (a(n/2)+1)%2))
CROSSREFS
A245187 is a very similar sequence.
Sequence in context: A208978 A333451 A101664 * A108803 A348920 A348921
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Mar 11 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 21:38 EDT 2024. Contains 374234 sequences. (Running on oeis4.)