20286025

Appears in sequences

• Number of acyclic digraphs with n unlabeled nodes.at n=8A003087
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.at n=44A361582
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with exactly k strongly connected components of size 1.at n=44A361590