This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049342 A049341/3. 1

%I

%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 A049341/3.

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

%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)=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

%F a(n)=3-(Fibonacci(n+6) mod 3). [From _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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 20 23:22 EDT 2019. Contains 321354 sequences. (Running on oeis4.)