login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118808 Number of partitions of n having exactly one part with multiplicity 3. 1
0, 0, 0, 1, 0, 1, 2, 3, 3, 5, 8, 13, 13, 23, 28, 40, 49, 71, 89, 123, 147, 198, 249, 329, 400, 518, 642, 825, 996, 1265, 1545, 1941, 2340, 2920, 3533, 4357, 5233, 6417, 7717, 9399, 11211, 13591, 16215, 19540, 23189, 27826, 32990, 39392, 46504, 55313, 65200 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
COMMENTS
Column 1 of A118806.
LINKS
FORMULA
G.f.=product([1-x^(3j)+x^(4j)]/(1-x^j), j=1..infinity)*sum(x^(3j)*(1-x^j)/[1-x^(3j)+x^(4j)], j=1..infinity).
EXAMPLE
a(9)=5 because we have [6,1,1,1],[4,2,1,1,1],[3,3,3],[3,3,1,1,1] and [3,2,2,2].
MAPLE
g:=product((1-x^(3*j)+x^(4*j))/(1-x^j), j=1..70)*sum(x^(3*j)*(1-x^j)/(1-x^(3*j)+x^(4*j)), j=1..70): gser:=series(g, x=0, 70): seq(coeff(gser, x, n), n=0..60);
MATHEMATICA
Table[Length[Select[IntegerPartitions[n], Count[Length/@Split[#], 3]==1&]], {n, 0, 60}] (* Harvey P. Dale, Mar 24 2011 *)
CROSSREFS
Sequence in context: A129577 A320784 A107854 * A265019 A193979 A059503
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Apr 29 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)