A378855 - cp's OEIS frontend

A378855 Triangle read by rows: T(n,k) is the number of sequences in which the games of a single-elimination tournament with n teams can be played if arbitrarily many arenas are available, the tournament bracket is chosen to the bracket with the largest such number of sequences, and the number of distinct times at which games are played is k, log_2(n) <= k <= n-1.

n	a(n)
2	1
3	0
4	1
5	0
6	1
7	2
8	0
9	0
10	2
11	3
12	0
13	0
14	2
15	9
16	8
17	0
18	0
19	1
20	12
21	30
22	20
23	0
24	0
25	1
26	22
27	102
28	160
29	80
30	0
31	0
32	0
33	10
34	114
35	380
36	485
37	210
38	0
39	0
40	0
41	10
42	198
43	1100
44	2495
45	2478
46	896
47	0
48	0
49	0
50	5
51	204
52	1930
53	7260
54	12810
55	10640
56	3360
57	0
58	0
59	0
60	5
61	344
62	4890
63	27110
64	72702

[1, 0, 1, 0, 1, 2, 0, 0, 2, 3, 0, 0, 2, 9, 8, 0, 0, 1, 12, 30, 20, 0, 0, 1, 22, 102, 160, 80, 0, 0, 0, 10, 114, 380, 485, 210, 0, 0, 0, 10, 198, 1100, 2495, 2478, 896, 0, 0, 0, 5, 204, 1930, 7260, 12810, 10640, 3360, 0, 0, 0, 5, 344, 4890, 27110, 72702]

cp's OEIS Frontend

Table of values

List of values