Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130486 Sum {0<=k<=n, k mod 8} (Partial sums of A010877). +0
13
0, 1, 3, 6, 10, 15, 21, 28, 28, 29, 31, 34, 38, 43, 49, 56, 56, 57, 59, 62, 66, 71, 77, 84, 84, 85, 87, 90, 94, 99, 105, 112, 112, 113, 115, 118, 122, 127, 133, 140, 140, 141, 143, 146, 150, 155, 161, 168, 168, 169, 171, 174, 178, 183, 189, 196, 196, 197, 199, 202, 206 (list; graph; listen)
OFFSET

0,3

FORMULA

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

MAPLE

a:=n->add(chrem( [n, j], [1, 8] ) , j=1..n):seq(a(n), n=0..60); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 07 2009]

CROSSREFS

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

Sequence in context: A033439 A061786 A105334 this_sequence A054636 A124158 A161208

Adjacent sequences: A130483 A130484 A130485 this_sequence A130487 A130488 A130489

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 31 2007

page 1

Search completed in 0.004 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research