10110735

Appears in sequences

• Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components.at n=26A361455
• Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n.at n=26A361527
• Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.at n=25A361592