A380166 - cp's OEIS frontend

A380166 Triangle read by rows: T(n,k) is the number of sequences in which the games of a fully symmetric single-elimination tournament with 2^n teams can be played if arbitrarily many arenas are available and the number of distinct times at which games are played is k, 1 <= k <= 2^n-1.

n	a(n)
1	1
2	0
3	1
4	2
5	0
6	0
7	1
8	22
9	102
10	160
11	80
12	0
13	0
14	0
15	1
16	672
17	45914
18	973300
19	9396760
20	49410424
21	155188488
22	304369008
23	376231680
24	284951040
25	120806400
26	21964800
27	0
28	0
29	0
30	0
31	1
32	458324
33	2493351562
34	1695612148252
35	328854102958150
36	26894789756402464
37	1153061834890296576
38	29635726970329429536

[1, 0, 1, 2, 0, 0, 1, 22, 102, 160, 80, 0, 0, 0, 1, 672, 45914, 973300, 9396760, 49410424, 155188488, 304369008, 376231680, 284951040, 120806400, 21964800, 0, 0, 0, 0, 1, 458324, 2493351562, 1695612148252, 328854102958150, 26894789756402464, 1153061834890296576, 29635726970329429536]

cp's OEIS Frontend

A380166 Triangle read by rows: T(n,k) is the number of sequences in which the games of a fully symmetric single-elimination tournament with 2^n teams can be played if arbitrarily many arenas are available and the number of distinct times at which games are played is k, 1 <= k <= 2^n-1.

Table of values

List of values