A091085 a(n) = mod(A078008(n),10).

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

Author

Paul Barry, Dec 18 2003

Keywords

• easy
• nonn

Comments

A078008(0), followed by A078008(1), A078008(2), A078008(3), A078008(4) repeating.

Links

• Index entries for linear recurrences with constant coefficients, signature (0,0,0,1).

Crossrefs

Cf. A078008.

Programs

Mathematica

LinearRecurrence[{0, 0, 0, 1}, {1, 0, 2, 2, 6}, 105] (* Georg Fischer, May 15 2019 *)

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.

Extensions

Terms a(75) ff. corrected by Georg Fischer, May 15 2019