Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130490
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130490 Sum {0<=k<=n, k mod 12} (Partial sums of A010881). +0
2
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 66, 67, 69, 72, 76, 81, 87, 94, 102, 111, 121, 132, 132, 133, 135, 138, 142, 147, 153, 160, 168, 177, 187, 198, 198, 199, 201, 204, 208, 213, 219, 226, 234, 243, 253, 264, 264, 265, 267, 270, 274, 279, 285, 292, 300 (list; graph; listen)
OFFSET

9,3

FORMULA

a(n)=66*floor(n/12)+A010881(n)*(A010881(n)+1)/2. G.f.: g(x)=(sum{1<=k<12, k*x^k})/((1-x^12)(1-x)). Also: g(x)=x(11x^12-12x^11+1)/((1-x^12)(1-x)^3).

CROSSREFS

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

Sequence in context: A105335 A130489 A033443 this_sequence A033444 A061791 A105336

Adjacent sequences: A130487 A130488 A130489 this_sequence A130491 A130492 A130493

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research