Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130482 Sum {0<=k<=n, k mod 4} (Partial sums of A010873). +0
26
0, 1, 3, 6, 6, 7, 9, 12, 12, 13, 15, 18, 18, 19, 21, 24, 24, 25, 27, 30, 30, 31, 33, 36, 36, 37, 39, 42, 42, 43, 45, 48, 48, 49, 51, 54, 54, 55, 57, 60, 60, 61, 63, 66, 66, 67, 69, 72, 72, 73, 75, 78, 78, 79, 81, 84, 84, 85, 87, 90, 90, 91, 93, 96, 96, 97, 99, 102, 102, 103, 105 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

Cf. A010872, A010874, A010875, A010876, A010877. A130481, A130483, A130484, A130485.

Adjacent sequences: A130479 A130480 A130481 this_sequence A130483 A130484 A130485

Sequence in context: A081289 A079093 A072910 this_sequence A025500 A135702 A108850

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