Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130488
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130488 Sum {0<=k<=n, k mod 10} (Partial sums of A010879). +0
8
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 45, 46, 48, 51, 55, 60, 66, 73, 81, 90, 90, 91, 93, 96, 100, 105, 111, 118, 126, 135, 135, 136, 138, 141, 145, 150, 156, 163, 171, 180, 180, 181, 183, 186, 190, 195, 201, 208, 216, 225, 225, 226, 228, 231, 235, 240, 246, 253 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

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

Adjacent sequences: A130485 A130486 A130487 this_sequence A130489 A130490 A130491

Sequence in context: A108923 A033441 A107082 this_sequence A061076 A054632 A109453

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