750744901domain: NAppears in sequencesNumber of labeled n-node digraphs in which every node belongs to a directed cycle.at n=6A086366Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.at n=21A361592