Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130487
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130487 Sum {0<=k<=n, k mod 9} (Partial sums of A010878). +0
11
0, 1, 3, 6, 10, 15, 21, 28, 36, 36, 37, 39, 42, 46, 51, 57, 64, 72, 72, 73, 75, 78, 82, 87, 93, 100, 108, 108, 109, 111, 114, 118, 123, 129, 136, 144, 144, 145, 147, 150, 154, 159, 165, 172, 180, 180, 181, 183, 186, 190, 195, 201, 208, 216, 216, 217, 219, 222, 226 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=36*floor(n/9)+A010878(n)*(A010878(n)+1)/2. G.f.: g(x)=(sum{1<=k<9, k*x^k})/((1-x^9)(1-x)). Also: g(x)=x(8x^9-9x^8+1)/((1-x^9)(1-x)^3).

CROSSREFS

Cf. A010872, A010873, A010874, A010875, A010876, A010877. A130481, A130482, A130483, A130484, A130485, A130486.

Adjacent sequences: A130484 A130485 A130486 this_sequence A130488 A130489 A130490

Sequence in context: A124157 A033440 A067525 this_sequence A108923 A033441 A107082

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 31 2007

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research