Irregular triangle read by rows where T(n,k) is the number of simple graphs covering n vertices with exactly k triangles, 0 <= k <= binomial(n,3).
A372167
Irregular triangle read by rows where T(n,k) is the number of simple graphs covering n vertices with exactly k triangles, 0 <= k <= binomial(n,3).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =3a(4) =1a(5) =22a(6) =12a(7) =6a(8) =0a(9) =1a(10) =237a(11) =220a(12) =165a(13) =70a(14) =35a(15) =30a(16) =0a(17) =10a(18) =0a(19) =0a(20) =1a(21) =3961a(22) =5460a(23) =5830a(24) =4140a(25) =2805a(26) =2112a(27) =1230a(28) =720a(29) =600
External references
- oeis: A372167