|
Search: id:A114329
|
|
|
| A114329 |
|
Triangle T(n,k) = number of partitions of n-set into lists (cf. A000262) with k lists of size 1. |
|
+0
1
|
|
| 1, 0, 1, 2, 0, 1, 6, 6, 0, 1, 36, 24, 12, 0, 1, 240, 180, 60, 20, 0, 1, 1920, 1440, 540, 120, 30, 0, 1, 17640, 13440, 5040, 1260, 210, 42, 0, 1, 183120, 141120, 53760, 13440, 2520, 336, 56, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
E.g.f.: exp(x/(1-x)+(y-1)*x). More generally, e.g.f. for number of partitions of n-set into lists with k lists of size m is exp(x/(1-x)+(y-1)*x^m).
|
|
EXAMPLE
|
1; 0,1; 2,0,1; 6,6,0,1; 36,24,12,0,1; 240,180,60,20,0,1; ...
|
|
CROSSREFS
|
Cf. A000262, A052845.
Sequence in context: A085845 A138106 A131689 this_sequence A101371 A078341 A065329
Adjacent sequences: A114326 A114327 A114328 this_sequence A114330 A114331 A114332
|
|
KEYWORD
|
easy,more,nonn,tabl
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 06 2006
|
|
|
Search completed in 0.002 seconds
|
