Irregular triangular array read by rows. T(n,k) is the number of simple labeled graphs on [n] with circuit rank equal to k, n >= 1, 0 <= k <= binomial(n-1,2).
A372153
Irregular triangular array read by rows. T(n,k) is the number of simple labeled graphs on [n] with circuit rank equal to k, n >= 1, 0 <= k <= binomial(n-1,2).
Terms
- a(0) =1a(1) =2a(2) =7a(3) =1a(4) =38a(5) =19a(6) =6a(7) =1a(8) =291a(9) =317a(10) =235a(11) =125a(12) =45a(13) =10a(14) =1a(15) =2932a(16) =5582a(17) =7120a(18) =6915a(19) =5215a(20) =3057a(21) =1371a(22) =455a(23) =105a(24) =15a(25) =1a(26) =36961a(27) =108244a(28) =207130a(29) =306775
External references
- oeis: A372153