1047008

Appears in sequences

• Number of unlabeled strongly connected digraphs with n nodes.at n=6A035512
• Triangle read by rows: T(n,m) is the number of semi-strong digraphs on n unlabeled nodes with m connected components.at n=15A106238
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.at n=22A361582
• Triangle read by rows: T(n,k) is the number of weakly connected digraphs on n unlabeled nodes with k strongly connected components.at n=22A361587
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.at n=22A361588