111359017198domain: NAppears in sequencesNumber of unlabeled digraphs on n vertices such that every vertex has outdegree 4.at n=8A185194Triangle 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=40A329228