257290

Appears in sequences

• Number of unlabeled digraphs on n vertices such that every vertex has outdegree 3.at n=6A185193
• 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=24A329228