This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091959 a(1)=1, a(2n)=(a(n)+1) mod 2, a(2n+1)=2*a(2n)+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, 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 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 Sequence in context: A292835 A140807 A232629 * A046094 A055976 A293305 Adjacent sequences:  A091956 A091957 A091958 * A091960 A091961 A091962 KEYWORD nonn AUTHOR Benoit Cloitre, Mar 13 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 20 01:06 EST 2018. Contains 299357 sequences. (Running on oeis4.)