Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of subdigraphs of the transitive tournament on n nodes that have k weak components.

A350609

Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of subdigraphs of the transitive tournament on n nodes that have k weak components.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =4a(4) =2a(5) =2a(6) =31a(7) =15a(8) =10a(9) =8a(10) =474a(11) =228a(12) =162a(13) =96a(14) =64a(15) =14357a(16) =7057a(17) =5242a(18) =3296a(19) =1792a(20) =1024a(21) =865024a(22) =438662a(23) =342394a(24) =222720a(25) =130048a(26) =65536a(27) =32768a(28) =103931595a(29) =54542867

External references