Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2*n/3) <= k <= binomial(n, 2).
A276640
Triangle T(n, k) = the number of point-labeled graphs with n points and k edges, no points isolated, no edges isolated. By rows, 0 <= n, ceiling(2*n/3) <= k <= binomial(n, 2).
Terms
- a(0) =1a(1) =3a(2) =1a(3) =16a(4) =15a(5) =6a(6) =1a(7) =125a(8) =222a(9) =205a(10) =120a(11) =45a(12) =10a(13) =1a(14) =90a(15) =1356a(16) =3670a(17) =5700a(18) =6165a(19) =4945a(20) =2997a(21) =1365a(22) =455a(23) =105a(24) =15a(25) =1a(26) =1680a(27) =18942a(28) =69450a(29) =156870
External references
- oeis: A276640