2411213698

Appears in sequences

• Number of semi-regular digraphs (with loops) on n unlabeled nodes with each node having out-degree 3.at n=5A005535
• 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=39A259471
• 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=41A259471