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

A361591

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =18a(8) =18a(9) =18a(10) =0a(11) =1606a(12) =1098a(13) =684a(14) =446a(15) =0a(16) =565080a(17) =263580a(18) =116370a(19) =55620a(20) =26430a(21) =0a(22) =734774776a(23) =225806940a(24) =68822910a(25) =24578010a(26) =9729090a(27) =3596762a(28) =0a(30) =680637057912

External references