Triangular array T(n,k) giving number of 3-connected graphs with n labeled nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n(n-1)/2).

A123542

Triangular array T(n,k) giving number of 3-connected graphs with n labeled nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n(n-1)/2).

Terms

    a(0) =1a(1) =15a(2) =10a(3) =1a(4) =70a(5) =492a(6) =690a(7) =395a(8) =105a(9) =15a(10) =1a(11) =5040a(12) =28595a(13) =58905a(14) =63990a(15) =42392a(16) =18732a(17) =5880a(18) =1330a(19) =210a(20) =21a(21) =1a(22) =16800a(23) =442680a(24) =2485920a(25) =6629056a(26) =10684723a(27) =11716068a(28) =9409806a(29) =5824980

External references