A365638 - cp's OEIS frontend

A365638 Triangular array read by rows: T(n, k) is the number of ways that a k-element transitive tournament can occur as a subtournament of a larger tournament on n labeled vertices.

n	a(n)
0	1
1	1
2	1
3	2
4	4
5	2
6	8
7	24
8	24
9	6
10	64
11	256
12	384
13	192
14	24
15	1024
16	5120
17	10240
18	7680
19	1920
20	120
21	32768
22	196608
23	491520
24	491520
25	184320
26	23040
27	720
28	2097152
29	14680064
30	44040192
31	55050240
32	27525120
33	5160960
34	322560
35	5040
36	268435456
37	2147483648
38	7516192768
39	11274289152
40	7046430720
41	1761607680
42	165150720
43	5160960
44	40320

[1, 1, 1, 2, 4, 2, 8, 24, 24, 6, 64, 256, 384, 192, 24, 1024, 5120, 10240, 7680, 1920, 120, 32768, 196608, 491520, 491520, 184320, 23040, 720, 2097152, 14680064, 44040192, 55050240, 27525120, 5160960, 322560, 5040, 268435456, 2147483648, 7516192768, 11274289152, 7046430720, 1761607680, 165150720, 5160960, 40320]

cp's OEIS Frontend

A365638 Triangular array read by rows: T(n, k) is the number of ways that a k-element transitive tournament can occur as a subtournament of a larger tournament on n labeled vertices.

Table of values

List of values