login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A135033
Period 5: repeat [2, 4, 6, 8, 0].
1
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,1
COMMENTS
"Cheerleader" sequence: reminiscent of the old cheer, "Two, Four, Six, Eight, Who do we appreciate?"
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)
EXAMPLE
a(0) = 2*((0+1) mod 5) = 2*(1 mod 5) = 2.
MATHEMATICA
PadRight[{}, 120, {2, 4, 6, 8, 0}] (* Harvey P. Dale, Nov 21 2018 *)
CROSSREFS
Cf. A010874.
Sequence in context: A374123 A328768 A275693 * A317647 A243590 A169933
KEYWORD
easy,nonn
AUTHOR
William A. Tedeschi, Feb 10 2008
STATUS
approved