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, 168237515231, 562653589699325, 5804974779117692851, 183661082435600715699525, 17666480975857520415035844209, 5146233384112747138137289281457185, 4534044032831010795055121790094091375613, 12081604867988522236034142764997925890594966047

Offset

1,2

References

E. Detjens, G. Gannot, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, "Technology Mapping in MIS", Proc. 1987 IEEE Internat. Conf. Computer-Aided Design, pp. 116-119.

Links

Andrew Howroyd, Table of n, a(n) for n = 1..60

Formula

a(n) = 2*A391487(n) - 1. - Andrew Howroyd, Dec 17 2025

Crossrefs

Main diagonal of A391484.

Cf. A037294, A037295, A037296, A037297, A037298, A391487.

Sequence in context: A380077 A020556 A303061 * A034219 A034238 A132486

Adjacent sequences: A007800 A007801 A007802 * A007804 A007805 A007806

Keyword

nonn

Author

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

Status

approved