Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130489 Sum {0<=k<=n, k mod 11} (Partial sums of A010880). +0
4
0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 55, 56, 58, 61, 65, 70, 76, 83, 91, 100, 110, 110, 111, 113, 116, 120, 125, 131, 138, 146, 155, 165, 165, 166, 168, 171, 175, 180, 186, 193, 201, 210, 220, 220, 221, 223, 226, 230, 235, 241, 248, 256, 265, 275, 275, 276 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

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

Sequence in context: A071817 A033442 A105335 this_sequence A033443 A130490 A033444

Adjacent sequences: A130486 A130487 A130488 this_sequence A130490 A130491 A130492

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 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research