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!)
 A270824 Period 16: repeat [0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1]. 1
 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1, 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1, 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1, 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1, 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1, 0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,-1,1). FORMULA a(n) = (floor((n+4)/4) - [floor(n/4) + floor((n+4)/4)] * [(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-8) + a(n-9) for n > 8. G.f.: x*(1 - x^2 + 2*x^3 + x^4 - x^6 + x^7)/((1 - x)*(1 + x^8)). (End) MATHEMATICA PadRight[{}, 120, {0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1}] (* Harvey P. Dale, Sep 16 2017 *) PROG (PARI) a(n)=[0, 1, 1, 0, 2, 3, 3, 2, 3, 2, 2, 3, 1, 0, 0, 1][n%16+1] \\ Charles R Greathouse IV, Jul 17 2016 CROSSREFS Cf. A270823. Sequence in context: A241539 A213512 A218774 * A048198 A096006 A182128 Adjacent sequences:  A270821 A270822 A270823 * A270825 A270826 A270827 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.)