24935913222domain: NAppears in sequencesNumber of weakly connected subgraphs of the transitive tournament on {1,...,n}.at n=8A350608Triangle 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.at n=36A350609