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