Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n.

A361527

Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =3a(6) =0a(7) =2a(8) =21a(9) =25a(10) =0a(11) =6a(12) =213a(13) =774a(14) =543a(15) =0a(16) =24a(17) =3470a(18) =30275a(19) =59830a(20) =29281a(21) =0a(22) =120a(23) =95982a(24) =1847265a(25) =7757355a(26) =10110735a(27) =3781503a(28) =0a(29) =720

External references