|
Search: id:A131632
|
|
|
| A131632 |
|
Triangle T(n,k) read by rows = number of partitions of n-set into k blocks with distinct sizes, k = 1..A003056(n). |
|
+0
1
|
|
| 1, 1, 1, 3, 1, 4, 1, 15, 1, 21, 60, 1, 63, 105, 1, 92, 448, 1, 255, 2016, 1, 385, 4980, 12600, 1, 1023, 15675, 27720, 1, 1585, 61644, 138600, 1, 4095, 155155, 643500, 1, 6475, 482573, 4408404, 1, 16383, 1733550, 12687675, 37837800, 1, 26332, 4549808
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Row sums = A007837. Sum k!*T(n,k) = A032011.
|
|
FORMULA
|
E.g.f. Product(1+y*x^n/n!,n=1..inf).
|
|
EXAMPLE
|
1
1
1,3
1,4
1,15
1,21,60
1,63,105
1,92,448
1,255,2016
1,385,4980,12600
1,1023,15675,27720
1,1585,61644,138600
1,4095,155155,643500
1,6475,482573,4408404
1,16383,1733550,12687675,37837800
|
|
CROSSREFS
|
Sequence in context: A078896 A079546 A014413 this_sequence A051348 A118874 A020851
Adjacent sequences: A131629 A131630 A131631 this_sequence A131633 A131634 A131635
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Sep 04 2007
|
|
|
Search completed in 0.002 seconds
|
