login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
"Cheerleader" sequence: reminiscent of the old cheer, "Two, Four, Six, Eight, Who do we appreciate?"
LINKS
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: A065804 A328768 A275693 * A317647 A243590 A169933
KEYWORD
easy,nonn
AUTHOR
William A. Tedeschi, Feb 10 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 07:10 EDT 2024. Contains 372388 sequences. (Running on oeis4.)