login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116635 Number of parts that are multiples of 3 in all partitions of n. 1
0, 0, 0, 1, 1, 2, 5, 7, 11, 19, 27, 40, 61, 85, 120, 170, 232, 316, 433, 576, 767, 1017, 1332, 1735, 2259, 2905, 3730, 4768, 6058, 7663, 9676, 12137, 15191, 18945, 23541, 29150, 36026, 44336, 54453, 66686, 81456, 99227, 120653, 146275, 177015, 213724 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

COMMENTS

a(n)=Sum(A116633(n,k),k=0..floor(n/3)).

FORMULA

G.f.=sum(x^(3i)/(1-x^(3i)), i=1..infinity)/product(1-x^j, j=1..infinity).

EXAMPLE

a(6)=5 because in the 11 partitions of 6, namely, [(6)],[5,1],[4,2],[4,1,1],[(3),(3)],[(3),2,1],[(3),1,1,1],[2,2,2],[2,2,1,1],[2,1,1,1,1] and [1,1,1,1,1,1], we have 5 multiples of 3 (shown between parentheses).

MAPLE

g:=sum(x^(3*i)/(1-x^(3*i)), i=1..50)/product(1-x^j, j=1..50): gser:=series(g, x=0, 60): seq(coeff(gser, x, n), n=0..52);

CROSSREFS

Cf. A116633.

Sequence in context: A179273 A045351 A051645 * A184774 A038884 A040122

Adjacent sequences:  A116632 A116633 A116634 * A116636 A116637 A116638

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 19 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 08:20 EST 2012. Contains 205729 sequences.