login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159955 Period 9 : 0,1,2,1,2,0,2,0,1 . 0
0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1, 0, 1, 2, 1, 2, 0, 2, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n+9)=a(n) with a(0)=a(5)=a(7)=0, a(1)=a(3)=a(8)=1, a(2)=a(4)=a(6)=2 .

a(n)=(1/36)*{5*(n mod 9)-3*[(n+1) mod 9]+9*[(n+2) mod 9]-7*[(n+3) mod 9]+9*[(n+4) mod 9]-3*[(n+5) mod 9]+5*[(n+6) mod 9]-3*[(n+7) mod 9]-3*[(n+8) mod 9]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Nov 12 2009]

a(n)= floor((4*n-9)/3) mod 3. [From Gary Detlefs (gdetlefs(AT)aol.com), May 15 2011]

CROSSREFS

Sequence in context: A166453 A118233 A181117 * A053838 A117167 A117169

Adjacent sequences:  A159952 A159953 A159954 * A159956 A159957 A159958

KEYWORD

easy,nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 27 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.