|
Search: id:A008637
|
|
|
| A008637 |
|
Number of partitions of n into at most 8 parts. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 7, 11, 15, 22, 29, 40, 52, 70, 89, 116, 146, 186, 230, 288, 352, 434, 525, 638, 764, 919, 1090, 1297, 1527, 1801, 2104, 2462, 2857, 3319, 3828, 4417, 5066, 5812, 6630, 7564, 8588, 9749, 11018, 12450, 14012, 15765, 17674, 19805, 22122
(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 357
|
|
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)
with(combstruct):ZL9:=[S, {S=Set(Cycle(Z, card<9))}, unlabeled]:seq(count(ZL9, size=n), n=0..47); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2007
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 8} ], {x, 0, 60} ], x ]
|
|
CROSSREFS
|
a(n)=A008284(n+8, 8), n >= 0.
Adjacent sequences: A008634 A008635 A008636 this_sequence A008638 A008639 A008640
Sequence in context: A027342 A085894 A026814 this_sequence A008631 A035978 A023029
|
|
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
|
