Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with exactly k strongly connected components of size 1.
A361590
Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with exactly k strongly connected components of size 1.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =2a(6) =5a(7) =5a(8) =0a(9) =6a(10) =90a(11) =55a(12) =42a(13) =0a(14) =31a(15) =5289a(16) =2451a(17) =974a(18) =592a(19) =0a(20) =302a(21) =1071691a(22) =323709a(23) =94332a(24) =29612a(25) =15616a(26) =0a(27) =5984a(28) =712342075a(29) =135208025
External references
- oeis: A361590