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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131291 Period 9: repeat 5, 4, 5, 3, 4, 3, 5, 4, 5. 12
5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4, 5, 3, 4, 3, 5, 4, 5, 5, 4 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,1).

FORMULA

a(n)=(1/108)*{13*(n mod 9)+[(n+1) mod 9]+25*[(n+2) mod 9]+[(n+3) mod 9]+[(n+4) mod 9]+25*[(n+5) mod 9]+25*[(n+6) mod 9]+[(n+7) mod 9]+25*[(n+8) mod 9]}, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Oct 24 2007

O.g.f.: (1-x)/(9(x^2+x+1))+2(1+x^2-x^3-x^5)/(3(x^6+x^3+1))-38/(9(x-1)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 17 2008

MAPLE

A131291 := proc(n) op((n mod 9)+1, [5, 4, 5, 3, 4, 3, 5, 4, 5]) ; end: seq(A131291(n), n=0..100) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008

CROSSREFS

Cf. A122219.

Sequence in context: A018840 A058209 A160789 * A131369 A122219 A093348

Adjacent sequences:  A131288 A131289 A131290 * A131292 A131293 A131294

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Sep 29 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 27 2008

Typo in definition corrected by Herman Jamke (hermanjamke(AT)fastmail.fm), Mar 22 2008

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 03:44 EST 2012. Contains 205860 sequences.