|
|
A327024
|
|
Ordered set partitions of the set {1, 2, ..., 4*n} with all block sizes divisible by 4, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.
|
|
3
|
|
|
1, 1, 1, 70, 1, 990, 34650, 1, 3640, 12870, 2702700, 63063000, 1, 9690, 251940, 26453700, 187065450, 17459442000, 305540235000, 1, 21252, 1470942, 2704156, 154448910, 8031343320, 9465511770, 374796021600, 3975514943400, 231905038365000, 3246670537110000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
T_{m}(n, k) gives the number of ordered set partitions of the set {1, 2, ..., m*n} into sized blocks of shape m*P(n, k), where P(n, k) is the k-th integer partition of n in the 'canonical' order A080577. Here we assume the rows of A080577 to be 0-based and m*[a, b, c,..., h] = [m*a, m*b, m*c,..., m*h]. Here is case m = 4. For instance 4*P(4, .) = [[16], [12, 4], [8, 8], [8, 4, 4], [4, 4, 4, 4]].
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle starts (note the subdivisions by ';' (A072233)):
[0] [1]
[1] [1]
[2] [1; 70]
[3] [1; 990; 34650]
[4] [1; 3640, 12870; 2702700; 63063000]
[5] [1; 9690, 251940; 26453700, 187065450; 17459442000; 305540235000]
[6] [1; 21252, 1470942, 2704156; 154448910, 8031343320, 9465511770;
374796021600, 3975514943400; 231905038365000; 3246670537110000]
.
T(4, 1) = 3640 because [12, 4] is the integer partition 4*P(4, 1) in the canonical order and there are 1820 set partitions which have the shape [12, 4]. Finally, since the order of the sets is taken into account, one gets 2!*1820 = 3640.
|
|
PROG
|
(Sage) # uses[GenOrdSetPart from A327022]
def A327024row(n): return GenOrdSetPart(4, n)
for n in (0..6): print(A327024row(n))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|