3596762

Appears in sequences

• Number of n-node labeled weakly connected acyclic digraphs.at n=6A082402
• Triangle read by rows: T(n,k) is the number of weakly connected simple digraphs on n labeled nodes with k strongly connected components.at n=27A361591
• Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.at n=22A380252