Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).
A360862
Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes 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) =5a(8) =1a(9) =10a(10) =20a(11) =5a(12) =1a(13) =14a(14) =48a(15) =36a(16) =1a(17) =18a(18) =99a(19) =153a(20) =30a(21) =1a(22) =23a(23) =181a(24) =481a(25) =277a(26) =17a(27) =1a(28) =28a(29) =303
External references
- oeis: A360862