Irregular triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and exactly k triangles, 0 <= k <= binomial(n,3).

A372170

Irregular triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and exactly k triangles, 0 <= k <= binomial(n,3).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =7a(4) =1a(5) =41a(6) =16a(7) =6a(8) =0a(9) =1a(10) =388a(11) =290a(12) =195a(13) =70a(14) =40a(15) =30a(16) =0a(17) =10a(18) =0a(19) =0a(20) =1a(21) =5789a(22) =6980a(23) =6910a(24) =4560a(25) =3030a(26) =2292a(27) =1230a(28) =780a(29) =600

External references