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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131091 Partial sums of A131707. 0
1, 2, 5, 12, 19, 20, 29, 38, 45, 48, 51, 60, 61, 62, 65, 72, 79, 80, 89, 98, 105, 108, 111, 120, 121, 122, 125, 132, 139, 140, 149, 158, 165, 168, 171, 180, 181, 182, 185, 192, 199, 200, 209, 218, 225, 228, 231, 240, 241, 242, 245, 252, 259, 260, 269, 278, 285 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n)=sum_{i=0..n} A131707(i). A131707(n)= A001333(n) mod 10.

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

CROSSREFS

Cf. A131725.

Sequence in context: A002355 A085395 A041641 * A116728 A095306 A079648

Adjacent sequences:  A131088 A131089 A131090 * A131092 A131093 A131094

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 16 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 17 19:13 EST 2012. Contains 206085 sequences.