Triangle read by rows: T(n,m) is the number of semi-strong digraphs on n unlabeled nodes with m connected components.

A106238

Triangle read by rows: T(n,m) is the number of semi-strong digraphs on n unlabeled nodes with m connected components.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =5a(4) =1a(5) =1a(6) =83a(7) =6a(8) =1a(9) =1a(10) =5048a(11) =88a(12) =6a(13) =1a(14) =1a(15) =1047008a(16) =5146a(17) =89a(18) =6a(19) =1a(20) =1a(21) =705422362a(22) =1052471a(23) =5151a(24) =89a(25) =6a(26) =1a(27) =1a(29) =706498096a(30) =1052569

External references