A049342 a(n) = A049341(n)/3.

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

Offset: 0

Author

N. J. A. Sloane

Keywords

• nonn

Links

• Michael Gilleland, Some Self-Similar Integer Sequences
• Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,1).

Programs

Mathematica

LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{1, 2, 3, 2, 2, 1, 3, 1},93] (* Ray Chandler, Aug 27 2015 *)

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