login
A091085
a(n) = mod(A078008(n),10).
0
1, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6, 0, 2, 2, 6
OFFSET
0,3
COMMENTS
A078008(0), followed by A078008(1), A078008(2), A078008(3), A078008(4) repeating.
FORMULA
G.f.: (1+2x^2+2x^3+5x^4)/(1-x^4).
E.g.f.: 2cos(x)-sin(x)+3exp(-x)/2+5exp(x)/2-5.
a(n) = 2cos(Pi*n/2)-sin(Pi*n/2)+3(-1)^n/2+5/2-5*0^n.
MATHEMATICA
LinearRecurrence[{0, 0, 0, 1}, {1, 0, 2, 2, 6}, 105] (* Georg Fischer, May 15 2019 *)
CROSSREFS
Cf. A078008.
Sequence in context: A158061 A270546 A163119 * A011144 A127649 A274440
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 18 2003
EXTENSIONS
Terms a(75) ff. corrected by Georg Fischer, May 15 2019
STATUS
approved