9727010

Appears in sequences

• Number of semi-regular digraphs (with loops) on n unlabeled nodes with each node having out-degree 2.at n=6A003286
• Triangle read by rows: T(n,k) is the number of semi-regular relations on n nodes with each node having out-degree k (0 <= k <= n).at n=38A259471
• Triangle read by rows: T(n,k) is the number of semi-regular relations on n nodes with each node having out-degree k (0 <= k <= n).at n=42A259471