Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131091 Partial sums of A131707. +0
1
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; listen)
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.

Adjacent sequences: A131088 A131089 A131090 this_sequence A131092 A131093 A131094

Sequence in context: A002355 A085395 A041641 this_sequence A116728 A095306 A079648

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

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 October 12 14:39 EDT 2008. Contains 144830 sequences.


AT&T Labs Research