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!)
 A131533 Period 6: repeat [0, 0, 0, 0, 1, -1]. 3
 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Index entries for linear recurrences with constant coefficients, signature (-1,-1,-1,-1,-1). FORMULA a(n) = (1/6)*{-(n mod 6)+2*[(n+1) mod 6]-[(n+2) mod 6]}. - Paolo P. Lava, Aug 28 2007 G.f.: x^4/((x+1)*(x^2+x+1)*(x^2-x+1)). - R. J. Mathar, Nov 14 2007 a(n) = - cos(Pi*n/3)/3 + sin(2*Pi*n/3)/sqrt(3) + (-1)^n/3. - R. J. Mathar, Oct 08 2011 a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) = 0 for n>4. - Wesley Ivan Hurt, Jun 20 2016 MAPLE A131533:=n->[0, 0, 0, 0, 1, -1][(n mod 6)+1]: seq(A131533(n), n=0..100); # Wesley Ivan Hurt, Jun 20 2016 MATHEMATICA PadRight[{}, 108, {0, 0, 0, 0, 1, -1}] (* Harvey P. Dale, Jan 27 2012 *) PROG (PARI) a(n)=[0, 0, 0, 0, 1, -1][n%6+1] \\ Charles R Greathouse IV, Jun 02 2011 (MAGMA) &cat [[0, 0, 0, 0, 1, -1]^^20]; // Wesley Ivan Hurt, Jun 20 2016 CROSSREFS Sequence in context: A059437 A152592 A275926 * A131532 A085114 A286336 Adjacent sequences:  A131530 A131531 A131532 * A131534 A131535 A131536 KEYWORD sign,easy,less AUTHOR Paul Curtz, Aug 26 2007 EXTENSIONS Edited by N. J. A. Sloane, Sep 15 2007 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 April 3 19:43 EDT 2020. Contains 333198 sequences. (Running on oeis4.)