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

 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: A030203 A208978 A101664 * A108803 A050601 A101650 Adjacent sequences:  A091949 A091950 A091951 * A091953 A091954 A091955 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 26 21:58 EST 2020. Contains 332295 sequences. (Running on oeis4.)