Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).

A361456

Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).