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

A123534

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

Terms

    a(0) =1a(1) =3a(2) =6a(3) =1a(4) =12a(5) =70a(6) =100a(7) =45a(8) =10a(9) =1a(10) =60a(11) =720a(12) =2445a(13) =3535a(14) =2697a(15) =1335a(16) =455a(17) =105a(18) =15a(19) =1a(20) =360a(21) =7560a(22) =46830a(23) =133581a(24) =216951a(25) =232820a(26) =183540a(27) =111765a(28) =53627a(29) =20307

External references