Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.
A361582
Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =5a(8) =5a(9) =6a(10) =0a(11) =83a(12) =62a(13) =42a(14) =31a(15) =0a(16) =5048a(17) =2494a(18) =1172a(19) =592a(20) =302a(21) =0a(22) =1047008a(23) =330063a(24) =103961a(25) =38312a(26) =15616a(27) =5984a(28) =0a(29) =705422362
External references
- oeis: A361582