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!)
A093718 a(n) = (n mod 3)^(n mod 2). 3
1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Period 6: repeat [1, 1, 1, 0, 1, 2]. - Joerg Arndt, Jun 09 2013
LINKS
FORMULA
a(n) = A010872(n)^A000035(n).
G.f.: ( -1-x^2-2*x^4+x^3 ) / ( (x-1)*(1-x+x^2)*(1+x+x^2) ). - R. J. Mathar, Jun 09 2013
a(n) = (n + 3) mod (2 + n mod 2) - Wesley Ivan Hurt, Aug 16 2014
From Wesley Ivan Hurt, Jun 23 2016: (Start)
a(n) = cos(n*Pi/6) * (6*cos(n*Pi/6)-3*cos(n*Pi/2)-sqrt(3)*sin(n*Pi/2))/3.
a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5).
a(n) = a(n-6) for n>5. (End)
MAPLE
A093718:=n->(n mod 3)^(n mod 2): seq(A093718(n), n=0..100); # Wesley Ivan Hurt, Aug 16 2014
MATHEMATICA
Table[Mod[n + 3, 2 + Mod[n, 2]], {n, 0, 100}] (* Wesley Ivan Hurt, Aug 16 2014 *)
LinearRecurrence[{1, -1, 1, -1, 1}, {1, 1, 1, 0, 1}, 120] (* Harvey P. Dale, Jan 17 2021 *)
PROG
(Magma) &cat [[1, 1, 1, 0, 1, 2]^^20]; // Wesley Ivan Hurt, Jun 23 2016
CROSSREFS
Sequence in context: A321755 A052314 A271606 * A278839 A348653 A278287
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Apr 12 2004
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 March 28 15:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)