Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130483
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130483 Sum {0<=k<=n, k mod 5} (Partial sums of A010874). +0
26
0, 1, 3, 6, 10, 10, 11, 13, 16, 20, 20, 21, 23, 26, 30, 30, 31, 33, 36, 40, 40, 41, 43, 46, 50, 50, 51, 53, 56, 60, 60, 61, 63, 66, 70, 70, 71, 73, 76, 80, 80, 81, 83, 86, 90, 90, 91, 93, 96, 100, 100, 101, 103, 106, 110, 110, 111, 113, 116, 120, 120, 121, 123, 126, 130, 130 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=10*floor(n/5)+A010874(n)*(A010874(n)+1)/2. G.f.: g(x)=(4x^4+3x^3+2x^2+x)/((1-x^5)(1-x)).

CROSSREFS

Cf. A010872, A010873, A010875, A010876, A010877. A130481, A130482, A130484, A130485.

Adjacent sequences: A130480 A130481 A130482 this_sequence A130484 A130485 A130486

Sequence in context: A138797 A009019 A032570 this_sequence A115012 A135738 A073851

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), May 29 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