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.

1, 7, 87, 3503, 425803, 154793519

Offset

1,2

References

E. Detjens and G. Gannot, "Technology Mapping in MIS", Proc. 1987 IEEE Internat. Conf. Computer-Aided Design, pp. 166ff.

Links

Table of n, a(n) for n=1..6.

Crossrefs

Sequence in context: A231447 A020556 A303061 * A034219 A034238 A132486

Adjacent sequences: A007800 A007801 A007802 * A007804 A007805 A007806

Keyword

nonn,more

Author

michelb(AT)watson.ibm.com (Michel Berkelaar)

Status

approved