Triangular array read by rows: T(n,k) is the number of labeled tournaments on [n] that have exactly k irreducible (strongly connected) components, n >= 0, 0 <= k <= n.
A354607
Triangular array read by rows: T(n,k) is the number of labeled tournaments on [n] that have exactly k irreducible (strongly connected) components, n >= 0, 0 <= k <= n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =2a(6) =0a(7) =2a(8) =0a(9) =6a(10) =0a(11) =24a(12) =16a(13) =0a(14) =24a(15) =0a(16) =544a(17) =240a(18) =120a(19) =0a(20) =120a(21) =0a(22) =22320a(23) =6608a(24) =2160a(25) =960a(26) =0a(27) =720a(28) =0a(29) =1677488
External references
- oeis: A354607