The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A270823 Period 16: repeat [0,2,3,1,1,3,2,0,1,3,2,0,0,2,3,1]. 1
 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1, 0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (1,-1,1,0,0,0,0,-1,1,-1,1). FORMULA a(n) = (n+1+(15-2n)*[(floor((n+12)/8)) mod 2*(floor((n+3)/2)) mod 2+(floor((n+4)/8)) mod 2*(floor((n+1)/2)) mod 2]) mod 4. From Chai Wah Wu, Jun 04 2016: (Start) a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-8) + a(n-9) - a(n-10) + a(n-11) for n > 10. G.f.: x*(2 + x + x^3 - x^5 + 2*x^8 + x^9)/((1 - x)*(1 + x^2)*(1 + x^8)). (End) MATHEMATICA PadRight[{}, 120, {0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1}] (* Harvey P. Dale, May 17 2017 *) PROG (PARI) a(n)=[0, 2, 3, 1, 1, 3, 2, 0, 1, 3, 2, 0, 0, 2, 3, 1][n%16+1] \\ Charles R Greathouse IV, Jul 17 2016 CROSSREFS Cf. A270824. Sequence in context: A317627 A271566 A296659 * A067627 A077233 A282290 Adjacent sequences:  A270820 A270821 A270822 * A270824 A270825 A270826 KEYWORD nonn,easy AUTHOR William Walkington, Mar 23 2016 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 17 14:07 EDT 2021. Contains 347478 sequences. (Running on oeis4.)