|
Search: id:A147784
|
|
|
| A147784 |
|
Number of partitions of n into parts divisible by 3 or 4. |
|
+0
5
|
|
| 1, 0, 0, 1, 1, 0, 2, 1, 2, 3, 2, 2, 7, 3, 4, 9, 9, 6, 15, 11, 15, 21, 19, 19, 39, 27, 32, 51, 51, 45, 78, 67, 82, 107, 104, 108, 172, 143, 165, 226, 232, 226, 328, 306, 356, 441, 446, 470, 655, 601, 677, 857, 891, 908, 1197, 1169, 1325, 1582
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
COMMENT
|
Also number of partitions of n with no part and no difference between two parts equal to 1,2 or 5.
Also number of partitions of n with no part appearing 1,2 or 5 times.
|
|
REFERENCES
|
A. E. Holroyd, Partition Identities and the Coin Exchange Problem, J. Combin. Theory Ser. A, 115 (2008) 1096-1101.
|
|
LINKS
|
A. E. Holroyd, Partition Identities and the Coin Exchange Problem
|
|
FORMULA
|
G.f.: product{k=1, infinity, (1-x^12k)/(1-x^3k)/(1-x^4k)}
|
|
CROSSREFS
|
Cf. A007690, A147783, A147785, A147786, A147787
Sequence in context: A143866 A155002 A103342 this_sequence A051329 A105499 A005812
Adjacent sequences: A147781 A147782 A147783 this_sequence A147785 A147786 A147787
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander E. Holroyd (holroyd at math.ubc.ca)
|
|
|
Search completed in 0.002 seconds
|
