Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components.

A361455

Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =3a(6) =0a(7) =18a(8) =21a(9) =25a(10) =0a(11) =1606a(12) =1173a(13) =774a(14) =543a(15) =0a(16) =565080a(17) =271790a(18) =122595a(19) =59830a(20) =29281a(21) =0a(22) =734774776a(23) =229224750a(24) =70500705a(25) =25349355a(26) =10110735a(27) =3781503a(28) =0a(30) =685793359804

External references