Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.
A361592
Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =3a(6) =18a(7) =21a(8) =0a(9) =25a(10) =1699a(11) =1080a(12) =774a(13) =0a(14) =543a(15) =587940a(16) =267665a(17) =103860a(18) =59830a(19) =0a(20) =29281a(21) =750744901a(22) =225144360a(23) =64169325a(24) =19791000a(25) =10110735a(26) =0a(27) =3781503a(29) =672637205149a(30) =126726655860
External references
- oeis: A361592