| Displaying 1-3 of 3 results found.
page
1
Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} such that the sum of the least entries of the blocks is k (1<=k<=n*(n+1)/2).
+10
8
1, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 4, 2, 1, 3, 2, 1, 0, 1, 1, 0, 8, 4, 2, 10, 6, 7, 2, 5, 3, 2, 1, 0, 1, 1, 0, 16, 8, 4, 29, 19, 21, 14, 23, 14, 18, 10, 7, 7, 5, 3, 2, 1, 0, 1, 1, 0, 32, 16, 8, 85, 56, 64, 42, 101, 62, 75, 69, 47, 54, 38, 38, 24, 23, 10, 13, 7, 5, 3, 2, 1, 0, 1, 1, 0, 64, 32, 16
Number of partitions of [2n] whose block maxima sum to 3n.
+10
5
1, 1, 2, 5, 10, 23, 47, 103, 209, 449, 908, 1909, 3864, 8011, 16165, 33244, 66933, 136628, 274876, 558107, 1121160, 2268526, 4552291, 9183569, 18417449, 37073504, 74300048, 149334422, 299134695, 600481001, 1202436958, 2411536369, 4827532935, 9675363921, 19364235775
Number of permutations of [n] whose cycle minima sum to n.
+10
4
1, 1, 0, 2, 3, 8, 90, 384, 2940, 18864, 232848, 1919520, 23364000, 261282240, 3486637440, 48900116160, 746747164800, 11559784320000, 201817271416320, 3580457619916800, 68121866659875840, 1366946563510886400, 28802183294533017600, 627950275273991577600
Search completed in 0.147 seconds
| 