Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).

A276639

Triangle T(m, n) = the number of point-labeled graphs with n points and m edges, no points isolated. By rows, n >= 0, ceiling(n/2) <= m <= binomial(n,2).

Terms

    a(0) =1a(1) =1a(2) =3a(3) =1a(4) =3a(5) =16a(6) =15a(7) =6a(8) =1a(9) =30a(10) =135a(11) =222a(12) =205a(13) =120a(14) =45a(15) =10a(16) =1a(17) =15a(18) =330a(19) =1581a(20) =3760a(21) =5715a(22) =6165a(23) =4945a(24) =2997a(25) =1365a(26) =455a(27) =105a(28) =15a(29) =1

External references