|
%I #17 Jan 01 2024 11:27:10
%S 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,
%T 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,
%U 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
%N a(n) = mod(A078008(n),10).
%C A078008(0), followed by A078008(1), A078008(2), A078008(3), A078008(4) repeating.
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,1).
%F G.f.: (1+2x^2+2x^3+5x^4)/(1-x^4).
%F E.g.f.: 2cos(x)-sin(x)+3exp(-x)/2+5exp(x)/2-5.
%F a(n) = 2cos(Pi*n/2)-sin(Pi*n/2)+3(-1)^n/2+5/2-5*0^n.
%t LinearRecurrence[{0, 0, 0, 1}, {1, 0, 2, 2, 6}, 105] (* _Georg Fischer_, May 15 2019 *)
%Y Cf. A078008.
%K easy,nonn
%O 0,3
%A _Paul Barry_, Dec 18 2003
%E Terms a(75) ff. corrected by _Georg Fischer_, May 15 2019
|
