|
%I #15 Jun 25 2022 00:08:52
%S 2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,
%T 0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,
%U 8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0
%N Period 5: repeat [2, 4, 6, 8, 0].
%C "Cheerleader" sequence: reminiscent of the old cheer, "Two, Four, Six, Eight, Who do we appreciate?"
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F a(n) = 2*((n+1) mod 5).
%F From _R. J. Mathar_, Feb 14 2008: (Start)
%F a(n) = 2*A010874(n+1).
%F O.g.f.: -2*(1 + 2x + 3x^2 + 4x^3)/((x-1)*(1 + x + x^2 + x^3 + x^4)).
%e a(0) = 2*((0+1) mod 5) = 2*(1 mod 5) = 2.
%t PadRight[{},120,{2,4,6,8,0}] (* _Harvey P. Dale_, Nov 21 2018 *)
%Y Cf. A010874.
%K easy,nonn
%O 0,1
%A _William A. Tedeschi_, Feb 10 2008
|
