A007803 - OEIS

This site is supported by donations to The OEIS Foundation.

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 (list; graph; refs; listen; history; 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.`
	CROSSREFS	`Sequence in context: A173812 A199027 A020556 * A034219 A034238 A132486` `Adjacent sequences: A007800 A007801 A007802 * A007804 A007805 A007806`
	KEYWORD	`nonn`
	AUTHOR	`michelb(AT)watson.ibm.com (Michel Berkelaar)`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.