|
Search: id:A008636
|
|
|
| A008636 |
|
Number of partitions of n into at most 7 parts. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 7, 11, 15, 21, 28, 38, 49, 65, 82, 105, 131, 164, 201, 248, 300, 364, 436, 522, 618, 733, 860, 1009, 1175, 1367, 1579, 1824, 2093, 2400, 2738, 3120, 3539, 4011, 4526, 5102, 5731, 6430, 7190, 8033, 8946, 9953, 11044, 12241, 13534, 14950
(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 356
|
|
MAPLE
|
1/(1-x)/(1-x^2)/(1-x^3)/(1-x^4)/(1-x^5)/(1-x^6)/(1-x^7)
with(combstruct):ZL8:=[S, {S=Set(Cycle(Z, card<8))}, unlabeled]: seq(count(ZL8, size=n), n=0..48); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 24 2007
B:=[S, {S = Set(Sequence(Z, 1 <= card), card <=7)}, unlabelled]: seq(combstruct[count](B, size=n), n=0..48); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 21 2009]
|
|
MATHEMATICA
|
CoefficientList[ Series[ 1/ Product[ 1 - x^n, {n, 1, 7} ], {x, 0, 60} ], x ]
|
|
CROSSREFS
|
a(n)=A008284(n+7, 7), n >= 0.
Sequence in context: A090693 A049756 A026813 this_sequence A008630 A035969 A042953
Adjacent sequences: A008633 A008634 A008635 this_sequence A008637 A008638 A008639
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 11 2000
|
|
|
Search completed in 0.002 seconds
|
