14971125930
domain: N
Appears in sequences
- Number of unlabeled digraphs on n vertices such that every vertex has outdegree 3.at n=8A185193
- Number of unlabeled digraphs on n vertices such that every vertex has outdegree 5.at n=8A185303
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.at n=39A329228
- Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.at n=41A329228