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!)
 A065252 The sequence A065251 reduced modulo 3 (i.e., replace every -1 with 2). 1
 1, 1, 0, 1, 0, 2, 1, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS FORMULA a(0)=0, a(2n) = 2 - a(n), a(2n+1) = 2 - ((a(n)+1) mod 3). MAPLE [seq((A065251(j) mod 3), j=1..120)]; CROSSREFS Sequence in context: A324831 A054522 A110250 * A115211 A097516 A219052 Adjacent sequences:  A065249 A065250 A065251 * A065253 A065254 A065255 KEYWORD nonn AUTHOR Antti Karttunen, Oct 25 2001 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 September 20 16:50 EDT 2021. Contains 347586 sequences. (Running on oeis4.)