|
|
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
|
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) = 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
|
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|