A362589 - cp's OEIS frontend

A362589 Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}.

n	a(n)
0	1
1	1
2	4
3	1
4	36
5	18
6	1
7	576
8	432
9	68
10	1
11	14400
12	14400
13	3900
14	250
15	1
16	518400
17	648000
18	252000
19	32400
20	922
21	1
22	25401600
23	38102400
24	19404000
25	3880800
26	262542
27	3430
28	1
29	1625702400
30	2844979200
31	1795046400
32	493920000
33	56664384
34	2119152
35	12868
36	1

[1, 1, 4, 1, 36, 18, 1, 576, 432, 68, 1, 14400, 14400, 3900, 250, 1, 518400, 648000, 252000, 32400, 922, 1, 25401600, 38102400, 19404000, 3880800, 262542, 3430, 1, 1625702400, 2844979200, 1795046400, 493920000, 56664384, 2119152, 12868, 1]

cp's OEIS Frontend

A362589 Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}.

Table of values

List of values