|
Search: id:A008641
|
|
|
| A008641 |
|
Number of partitions of n into at most 12 parts. |
|
+0
2
|
|
| 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 100, 133, 172, 224, 285, 366, 460, 582, 725, 905, 1116, 1380, 1686, 2063, 2503, 3036, 3655, 4401, 5262, 6290, 7476, 8877, 10489, 12384, 14552, 17084, 19978, 23334, 27156, 31570, 36578, 42333, 48849, 56297
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
With a different offset, number of partitions of n in which the greatest part is 12.
|
|
REFERENCES
|
A. Cayley, Collected Mathematical Papers. Vols. 1-13, Cambridge Univ. Press, London, 1889-1897, Vol. 10, p. 415.
H. Gupta et al., Tables of Partitions. Royal Society Mathematical Tables, Vol. 4, Cambridge Univ. Press, 1958, p. 2.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 361
|
|
MAPLE
|
1/(1-x)/(1-x^2)/(1-x^3)/(1-x^4)/(1-x^5)/(1-x^6)/(1-x^7)/(1-x^8)/(1-x^9)/(1-x^10)/(1-x^11)/(1-x^12)
with(combstruct):ZL13:=[S, {S=Set(Cycle(Z, card<13))}, unlabeled]:seq(count(ZL13, size=n), n=0..46); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2007
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 12} ], {x, 0, 60} ], x ]
Table[ Length[ Select[ Partitions[n], First[ # ] == 12 & ]], {n, 1, 60} ]
|
|
CROSSREFS
|
a(n)=A008284(n+12, 12), n >= 0.
Cf. A026810, A026811, A026812, A026813, A026814, A026815, A026816.
Sequence in context: A036011 A104501 A008635 this_sequence A046054 A092885 A000041
Adjacent sequences: A008638 A008639 A008640 this_sequence A008642 A008643 A008644
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 11 2000
|
|
|
Search completed in 0.002 seconds
|
