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

A361588

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

Terms

    a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =0a(7) =5a(8) =4a(9) =4a(10) =0a(11) =83a(12) =57a(13) =37a(14) =25a(15) =0a(16) =5048a(17) =2411a(18) =1110a(19) =550a(20) =271a(21) =0a(22) =1047008a(23) =325015a(24) =101467a(25) =37140a(26) =15024a(27) =5682a(28) =0a(29) =705422362

External references