login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049342 A049341/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

COMMENTS

Terms of the simple continued fraction of 293/[17*sqrt(287)-84]. [From Paolo P. Lava, Aug 06 2009]

LINKS

Table of n, a(n) for n=0..92.

Michael Gilleland, Some Self-Similar Integer Sequences

Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 1).

FORMULA

Period 8: repeat  (1, 2, 3, 2, 2, 1, 3, 1).

a(n)=1/224*{15*(n mod 8)+71*[(n+1) mod 8]-41*[(n+2) mod 8]+43*[(n+3) mod 8]+15*[(n+4) mod 8]+43*[(n+5) mod 8]-13*[(n+6) mod 8]-13*[(n+7) mod 8]} with n>=0 - Paolo P. Lava, Nov 27 2006

a(n)=3-(Fibonacci(n+6) mod 3). [From 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 A160570 A128830

Adjacent sequences:  A049339 A049340 A049341 * A049343 A049344 A049345

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 03:42 EST 2016. Contains 278993 sequences.