login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
1, 7, 87, 3503, 425803, 154793519 (list; graph; refs; listen; history; text; internal format)
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

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 19:44 EDT 2018. Contains 316401 sequences. (Running on oeis4.)