Number of connected series-parallel graphs with a longest path of at most n edges and also a largest cut set of at most n edges.
A007803
Number of connected series-parallel graphs with a longest path of at most n edges and also a largest cut set of at most n edges.
Terms
- a(0) =1a(1) =7a(2) =87a(3) =3503a(4) =425803a(5) =154793519a(6) =168237515231
External references
- oeis: A007803