id:A007803 - OEIS Search Results

Search: id:A007803

Displaying 1-1 of 1 results found.

page 1

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

1, 7, 87, 3503, 425803, 154793519 (list; graph; listen)

	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: A092586 A048363 A020556 this_sequence A034219 A034238 A132486` `Adjacent sequences: A007800 A007801 A007802 this_sequence A007804 A007805 A007806`
	KEYWORD	`nonn`
	AUTHOR	`michelb(AT)watson.ibm.com (Michel Berkelaar)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.