Square table, read by antidiagonals, where T(n,k) equals the number of k-tournament sequences of length n for k>=1, with T(0,k) = 1 for k>=1 and T(n,1) = 0 for n>0.
A113080
Square table, read by antidiagonals, where T(n,k) equals the number of k-tournament sequences of length n for k>=1, with T(0,k) = 1 for k>=1 and T(n,1) = 0 for n>0.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =2a(8) =2a(9) =1a(10) =0a(11) =7a(12) =10a(13) =3a(14) =1a(15) =0a(16) =41a(17) =114a(18) =27a(19) =4a(20) =1a(21) =0a(22) =397a(23) =2970a(24) =693a(25) =56a(26) =5a(27) =1a(28) =0a(29) =6377
External references
- oeis: A113080