Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130485 Sum {0<=k<=n, k mod 7} (Partial sums of A010876). +0
21
0, 1, 3, 6, 10, 15, 21, 21, 22, 24, 27, 31, 36, 42, 42, 43, 45, 48, 52, 57, 63, 63, 64, 66, 69, 73, 78, 84, 84, 85, 87, 90, 94, 99, 105, 105, 106, 108, 111, 115, 120, 126, 126, 127, 129, 132, 136, 141, 147, 147, 148, 150, 153, 157, 162, 168, 168, 169, 171, 174, 178, 183 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

Cf. A010872, A010873, A010874, A010875, A010877. A130481, A130482, A130483, A130484.

Adjacent sequences: A130482 A130483 A130484 this_sequence A130486 A130487 A130488

Sequence in context: A096895 A034175 A139131 this_sequence A115015 A056150 A033439

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