Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130481
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130481 Sum {0<=k<=n, k mod 3} (Partial sums of A010872). +0
26
0, 1, 3, 3, 4, 6, 6, 7, 9, 9, 10, 12, 12, 13, 15, 15, 16, 18, 18, 19, 21, 21, 22, 24, 24, 25, 27, 27, 28, 30, 30, 31, 33, 33, 34, 36, 36, 37, 39, 39, 40, 42, 42, 43, 45, 45, 46, 48, 48, 49, 51, 51, 52, 54, 54, 55, 57, 57, 58, 60, 60, 61, 63, 63, 64, 66, 66, 67, 69, 69, 70, 72, 72 (list; graph; listen)
OFFSET

0,3

FORMULA

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

CROSSREFS

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

Adjacent sequences: A130478 A130479 A130480 this_sequence A130482 A130483 A130484

Sequence in context: A074883 A011762 A092200 this_sequence A098238 A088651 A023837

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