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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156551 Period 10: 8,6,0,4,2,2,4,0,6,8 repeated. 1
8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

See A131715.

FORMULA

a(n) = A155110(n) mod 10.

G.f.: 2*(4*x^8-x^7+x^6+x^5+x^3+x^2-x+4)/((1-x)*(x^4-x^3+x^2-x+1)*(x^4+x^3+x^2+x+1)) . - R. J. Mathar, Feb 23 2009

a(n)=(1/45)*{4*(n mod 10)-5*[(n+1) mod 10]-23*[(n+2) mod 10]+22*[(n+3) mod 10]-5*[(n+4) mod 10]+4*[(n+5) mod 10]+13*[(n+6) mod 10]-14*[(n+7) mod 10]+31*[(n+8) mod 10]+13*[(n+9) mod 10]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 13 2009]

CROSSREFS

Sequence in context: A199473 A153617 A069855 * A074738 A010115 A197759

Adjacent sequences:  A156548 A156549 A156550 * A156552 A156553 A156554

KEYWORD

nonn,easy,less

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Feb 09 2009

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 23 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 14 23:53 EST 2012. Contains 205689 sequences.