|
Search: id:A008639
|
|
|
| A008639 |
|
Number of partitions of n into at most 10 parts. |
|
+0
2
|
|
| 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 55, 75, 97, 128, 164, 212, 267, 340, 423, 530, 653, 807, 984, 1204, 1455, 1761, 2112, 2534, 3015, 3590, 4242, 5013, 5888, 6912, 8070, 9418, 10936, 12690, 14663, 16928, 19466, 22367, 25608, 29292, 33401, 38047
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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 359
|
|
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)
with(combstruct):ZL11:=[S, {S=Set(Cycle(Z, card<11))}, unlabeled]:seq(count(ZL11, size=n), n=0..46); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2007
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 10} ], {x, 0, 60} ], x ]
|
|
CROSSREFS
|
Essentially same as A026816.
a(n)=A008284(n+10, 10), n >= 0.
Sequence in context: A036009 A053691 A026816 this_sequence A008633 A035999 A036010
Adjacent sequences: A008636 A008637 A008638 this_sequence A008640 A008641 A008642
|
|
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
|
