Triangle 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.

A329228

Triangle 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.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =6a(8) =6a(9) =1a(10) =1a(11) =13a(12) =79a(13) =13a(14) =1a(15) =1a(16) =40a(17) =1499a(18) =1499a(19) =40a(20) =1a(21) =1a(22) =100a(23) =35317a(24) =257290a(25) =35317a(26) =100a(27) =1a(28) =1a(29) =291

External references