|
| |
| |
|
|
|
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). - 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). - 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
Adjacent sequences: A049339 A049340 A049341 * A049343 A049344 A049345
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane
|
|
|
STATUS
|
approved
|
| |
|
|
