Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130484
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130484 Sum {0<=k<=n, k mod 6} (Partial sums of A010875). +0
22
0, 1, 3, 6, 10, 15, 15, 16, 18, 21, 25, 30, 30, 31, 33, 36, 40, 45, 45, 46, 48, 51, 55, 60, 60, 61, 63, 66, 70, 75, 75, 76, 78, 81, 85, 90, 90, 91, 93, 96, 100, 105, 105, 106, 108, 111, 115, 120, 120, 121, 123, 126, 130, 135, 135, 136, 138, 141, 145, 150, 150, 151, 153 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

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

Adjacent sequences: A130481 A130482 A130483 this_sequence A130485 A130486 A130487

Sequence in context: A104619 A105333 A126234 this_sequence A074374 A109804 A120993

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