The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A049342 a(n) = A049341(n)/3. 1
1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 3, 1, 1, 2, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
Period 8: repeat (1, 2, 3, 2, 2, 1, 3, 1).
a(n) = 3 - (Fibonacci(n+6) mod 3). - Gary Detlefs, Mar 13 2011
MATHEMATICA
LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1}, {1, 2, 3, 2, 2, 1, 3, 1}, 93] (* Ray Chandler, Aug 27 2015 *)
CROSSREFS
Sequence in context: A186037 A144365 A152197 * A112966 A286657 A334052
KEYWORD
nonn
AUTHOR
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 June 19 05:57 EDT 2024. Contains 373492 sequences. (Running on oeis4.)