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