103931595

Appears in sequences

• Number of weakly connected subgraphs of the transitive tournament on {1,...,n}.at n=7A350608
• 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.at n=28A350609