Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

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 (ppl(AT)spl.at), 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: A123587 A018840 A058209 this_sequence A131369 A122219 A093348

Adjacent sequences: A131288 A131289 A131290 this_sequence 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

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 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research