Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.
A362013
Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =2a(5) =1a(6) =27a(7) =27a(8) =9a(9) =1a(10) =2401a(11) =1372a(12) =294a(13) =28a(14) =1a(15) =759375a(16) =253125a(17) =33750a(18) =2250a(19) =75a(20) =1a(21) =887503681a(22) =171774906a(23) =13852815a(24) =595820a(25) =14415a(26) =186a(27) =1a(29) =437664515463a(30) =20841167403
External references
- oeis: A362013