Triangular array read by rows: T(n, k) is the number of ways that a k-element transitive tournament can occur as a subtournament of a larger tournament on n labeled vertices.
A365638
Triangular array read by rows: T(n, k) is the number of ways that a k-element transitive tournament can occur as a subtournament of a larger tournament on n labeled vertices.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =2a(6) =8a(7) =24a(8) =24a(9) =6a(10) =64a(11) =256a(12) =384a(13) =192a(14) =24a(15) =1024a(16) =5120a(17) =10240a(18) =7680a(19) =1920a(20) =120a(21) =32768a(22) =196608a(23) =491520a(24) =491520a(25) =184320a(26) =23040a(27) =720a(28) =2097152a(29) =14680064
External references
- oeis: A365638