A135033 Period 5: repeat [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, 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, 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, 2, 4, 6, 8, 0

Offset: 0

Author

William A. Tedeschi, Feb 10 2008

Keywords

• easy
• nonn

Comments

"Cheerleader" sequence: reminiscent of the old cheer, "Two, Four, Six, Eight, Who do we appreciate?"

Examples

			a(0) = 2*((0+1) mod 5) = 2*(1 mod 5) = 2.
		

Links

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

Crossrefs

Cf. A010874.

Programs

Mathematica

PadRight[{},120,{2,4,6,8,0}] (* Harvey P. Dale, Nov 21 2018 *)

Formula

a(n) = 2*((n+1) mod 5).

From R. J. Mathar, Feb 14 2008: (Start)

a(n) = 2*A010874(n+1).

O.g.f.: -2*(1 + 2x + 3x^2 + 4x^3)/((x-1)*(1 + x + x^2 + x^3 + x^4)). (End)