Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130910
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130910 Sum {0<=k<=n, k mod 16} (Partial sums of A130909). +0
2
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 120, 121, 123, 126, 130, 135, 141, 148, 156, 165, 175, 186, 198, 211, 225, 240, 240, 241, 243, 246, 250, 255, 261, 268, 276, 285, 295, 306, 318, 331, 345, 360, 360, 361, 363, 366, 370, 375, 381, 388 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=120*floor(n/16)+A130909(n)*(A130909(n)+1)/2. - G.f.: g(x)=(sum{1<=k<16, k*x^k})/((1-x^16)(1-x)). Also: g(x)=x(15x^16-16x^15+1)/((1-x^16)(1-x)^3).

CROSSREFS

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

Sequence in context: A033444 A061791 A105336 this_sequence A105337 A105338 A105339

Adjacent sequences: A130907 A130908 A130909 this_sequence A130911 A130912 A130913

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 11 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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research