A327022 Partition triangle read by rows. Number of ordered set partitions of the set {1, 2, ..., 2*n} with all block sizes divisible by 2.
1, 1, 1, 6, 1, 30, 90, 1, 56, 70, 1260, 2520, 1, 90, 420, 3780, 9450, 75600, 113400, 1, 132, 990, 924, 8910, 83160, 34650, 332640, 1247400, 6237000, 7484400, 1, 182, 2002, 6006, 18018, 270270, 252252, 630630, 1081080, 15135120, 12612600, 37837800, 189189000, 681080400, 681080400
Offset: 0
Examples
Triangle starts (note the subdivisions by ';' (A072233)): [0] [1] [1] [1] [2] [1; 6] [3] [1; 30; 90] [4] [1; 56, 70; 1260; 2520] [5] [1; 90, 420; 3780, 9450; 75600; 113400] [6] [1; 132, 990, 924; 8910, 83160, 34650; 332640, 1247400; 6237000; 7484400] . T(4, 1) = 56 because [6, 2] is the integer partition 2*P(4, 1) in the canonical order and there are 28 set partitions which have the shape [6, 2] (an example is {{1, 3, 4, 5, 6, 8}, {2, 7}}). Finally, since the order of the sets is taken into account, one gets 2!*28 = 56.
Comments