712342075domain: NAppears in sequencesNumber of digraphs on n unlabeled nodes in which every node belongs to a directed cycle.at n=7A361586Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with exactly k strongly connected components of size 1.at n=28A361590