Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k isolated strongly connected components, n>=0, 0<=k<=n.

A362226

Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k isolated strongly connected components, n>=0, 0<=k<=n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =2a(4) =1a(5) =1a(6) =36a(7) =24a(8) =3a(9) =1a(10) =2240a(11) =1762a(12) =87a(13) =6a(14) =1a(15) =462720a(16) =577000a(17) =8630a(18) =215a(19) =10a(20) =1a(21) =332613632a(22) =737645836a(23) =3455820a(24) =26085a(25) =435a(26) =15a(27) =1a(28) =867410804736a(30) =5166693532

External references