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!)
 A131532 Period 6: repeat [0, 0, 0, 0, 1, 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, 0, 0, 1, 1, 0, 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/90)*{17*(n mod 6)+2*[(n+1) mod 6]-13*[(n+2) mod 6]+2*[(n+3) mod 6]+2*[(n+4) mod 6]+2*[(n+5) 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 From Wesley Ivan Hurt, Jun 19 2016: (Start) a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4. a(n) = sin(n*Pi/3)*(2*sin(n*Pi/3)-sqrt(3))/3. (End) MAPLE A131532:=n->[0, 0, 0, 0, 1, 1][(n mod 6)+1]: seq(A131532(n), n=0..100); # Wesley Ivan Hurt, Jun 19 2016 MATHEMATICA PadRight[{}, 200, {0, 0, 0, 0, 1, 1}] (* Wesley Ivan Hurt, Jun 19 2016 *) PROG (PARI) a(n)=n%6>3 \\ Jaume Oliver Lafont, Aug 28 2009 (MAGMA) &cat[[0, 0, 0, 0, 1, 1]^^20]; // Wesley Ivan Hurt, Jun 19 2016 CROSSREFS Sequence in context: A152592 A275926 A131533 * A085114 A286336 A011661 Adjacent sequences:  A131529 A131530 A131531 * A131533 A131534 A131535 KEYWORD nonn,easy 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.)