The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131719 Period 6: repeat [0, 1, 1, 1, 1, 0]. 10
0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
G.f.: -(x^2+1)*x/(x-1)/(x^2+x+1)/(x^2-x+1). - R. J. Mathar, Nov 14 2007
a(n) = 2/3-cos(Pi*n/3)/2+sqrt(3)*sin(Pi*n/3)/6 -cos(2*Pi*n/3)/6 +sqrt(3)*sin(2*Pi*n/3)/6. - R. J. Mathar, Oct 08 2011
a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4. - Wesley Ivan Hurt, Jun 19 2016
a(n+3) = A000358(n)(mod 2), for n>0. - John M. Campbell, Jul 08 2016
MAPLE
A131719:=n->[0, 1, 1, 1, 1, 0][(n mod 6)+1]: seq(A131719(n), n=0..100); # Wesley Ivan Hurt, Jun 19 2016
MATHEMATICA
PadRight[{}, 200, {0, 1, 1, 1, 1, 0}] (* Wesley Ivan Hurt, Jun 19 2016 *)
PROG
(PARI) a(n)=[0, 1, 1, 1, 1, 0][n%6+1] \\ Charles R Greathouse IV, Jun 02 2011
(Magma) &cat[[0, 1, 1, 1, 1, 0]^^20]; // Wesley Ivan Hurt, Jun 19 2016
CROSSREFS
Sequence in context: A102460 A080908 A131720 * A342460 A100656 A285274
KEYWORD
nonn,easy,less
AUTHOR
Paul Curtz, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 30 15:02 EDT 2024. Contains 372968 sequences. (Running on oeis4.)