Irregular triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2.
A331438
Irregular triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =4a(11) =0a(12) =0a(13) =1a(14) =0a(15) =0a(16) =0a(17) =0a(18) =5a(19) =0a(20) =0a(21) =20a(22) =15a(23) =10a(24) =1a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0
External references
- oeis: A331438