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

A123527

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

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =16a(5) =15a(6) =6a(7) =1a(8) =125a(9) =222a(10) =205a(11) =120a(12) =45a(13) =10a(14) =1a(15) =1296a(16) =3660a(17) =5700a(18) =6165a(19) =4945a(20) =2997a(21) =1365a(22) =455a(23) =105a(24) =15a(25) =1a(26) =16807a(27) =68295a(28) =156555a(29) =258125

External references