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.
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.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =0a(8) =2a(9) =3a(10) =0a(11) =0a(12) =2a(13) =9a(14) =8a(15) =0a(16) =0a(17) =1a(18) =12a(19) =30a(20) =20a(21) =0a(22) =0a(23) =1a(24) =22a(25) =102a(26) =160a(27) =80a(28) =0a(29) =0
External references
- oeis: A378855