|
Search: id:A133118
|
|
|
| A133118 |
|
Number of partitions of n-set with 3 block sizes. |
|
+0
1
|
|
| 60, 315, 2268, 14742, 72180, 464640, 2676366, 16400098, 94209206, 673282610, 4095231104, 29371828846, 197547348216, 1513916607683, 10904464442572, 87070803499372, 673555061736062
(list; graph; listen)
|
|
|
OFFSET
|
6,1
|
|
|
FORMULA
|
We obtain e.g.f. for number of partitions of n-set with m block sizes if we substitute x(i) with -Sum_{k>0} ((1-exp(x^k/k!))^i in cycle index Z(S(m); x(1),x(2),..,x(n)) of symmetric group S(m) of degree m.
|
|
CROSSREFS
|
Cf. A038041, A088142, A122404, A005225, A005772.
Sequence in context: A063497 A096363 A033591 this_sequence A092478 A024184 A119631
Adjacent sequences: A133115 A133116 A133117 this_sequence A133119 A133120 A133121
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 18 2007
|
|
|
Search completed in 0.002 seconds
|
