login
This site is supported by donations 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). 0
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; internal format)
OFFSET

1,5

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

Sequence in context: A161491 A030203 A101664 * A108803 A050601 A101650

Adjacent sequences:  A091949 A091950 A091951 * A091953 A091954 A091955

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 11 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.