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

A062734

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

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =3a(6) =1a(7) =0a(8) =0a(9) =0a(10) =16a(11) =15a(12) =6a(13) =1a(14) =0a(15) =0a(16) =0a(17) =0a(18) =125a(19) =222a(20) =205a(21) =120a(22) =45a(23) =10a(24) =1a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0

External references