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

%I #27 Feb 19 2024 01:56:34

%S 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,

%T 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,

%U 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

%N a(n) = A049341(n)/3.

%H Michael Gilleland, <a href="/selfsimilar.html">Some Self-Similar Integer Sequences</a>

%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,0,0,1).

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

%F a(n) = 3 - (Fibonacci(n+6) mod 3). - _Gary Detlefs_, Mar 13 2011

%t LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1},{1, 2, 3, 2, 2, 1, 3, 1},93] (* _Ray Chandler_, Aug 27 2015 *)

%K nonn

%O 0,2

%A _N. J. A. Sloane_

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 April 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)