Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes, no cut-points and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).
A360870
Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes, no cut-points and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =1a(6) =7a(7) =2a(8) =1a(9) =10a(10) =8a(11) =2a(12) =1a(13) =14a(14) =19a(15) =11a(16) =1a(17) =18a(18) =40a(19) =48a(20) =7a(21) =1a(22) =23a(23) =77a(24) =154a(25) =70a(26) =5a(27) =1a(28) =28a(29) =132
External references
- oeis: A360870