Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).

A046752

Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =1a(8) =3a(9) =5a(10) =1a(11) =4a(12) =13a(13) =4a(14) =1a(15) =6a(16) =26a(17) =24a(18) =5a(19) =1a(20) =7a(21) =47a(22) =84a(23) =38a(24) =1a(25) =9a(26) =78a(27) =233a(28) =216a(29) =23

External references