Irregular triangle read by rows: T(n,k) (n >= 1, 0 <= k <= (n-1)*(n-2)/2) = number of weakly connected subdigraphs of the transitive tournament on n nodes that have k arcs.
A350610
Irregular triangle read by rows: T(n,k) (n >= 1, 0 <= k <= (n-1)*(n-2)/2) = number of weakly connected subdigraphs of the transitive tournament on n nodes that have k arcs.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =1a(5) =6a(6) =15a(7) =9a(8) =1a(9) =10a(10) =45a(11) =120a(12) =162a(13) =109a(14) =27a(15) =1a(16) =15a(17) =105a(18) =455a(19) =1365a(20) =2755a(21) =3738a(22) =3353a(23) =1889a(24) =600a(25) =81a(26) =1a(27) =21a(28) =210a(29) =1330
External references
- oeis: A350610