Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135033
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135033 Period 5: repeat 2,4,6,8,0. +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; listen)
OFFSET

0,1

COMMENT

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

FORMULA

a(n) = 2*[(n+1) mod 5]

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)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 14 2008

EXAMPLE

a(0) = 2*[(0+1) mod 5] = 2*(1 mod 5) = 2

CROSSREFS

Sequence in context: A105176 A061937 A065804 this_sequence A004520 A073909 A036211

Adjacent sequences: A135030 A135031 A135032 this_sequence A135034 A135035 A135036

KEYWORD

easy,nonn

AUTHOR

William A. Tedeschi (fynmun(AT)hotmail.com), Feb 10 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research