Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118808 Number of partitions of n having exactly one part with multiplicity 3. +0
2
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; listen)
OFFSET

0,7

COMMENT

Column 1 of A118806.

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);

CROSSREFS

Cf. A118806, A118807, A116596.

Sequence in context: A017820 A129577 A107854 this_sequence A059503 A065460 A001180

Adjacent sequences: A118805 A118806 A118807 this_sequence A118809 A118810 A118811

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2006

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research