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

A361587

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =5a(8) =4a(9) =4a(10) =0a(11) =83a(12) =56a(13) =36a(14) =24a(15) =0a(16) =5048a(17) =2406a(18) =1101a(19) =542a(20) =267a(21) =0a(22) =1047008a(23) =324917a(24) =101307a(25) =37017a(26) =14947a(27) =5647a(28) =0a(29) =705422362

External references