id:A005643 - OEIS Search Results

Search: id:A005643

Displaying 1-1 of 1 results found.

page 1

Number of labeled irreducible 2-connected graphs with n edges.
(Formerly M5191)

+0
2

1, 26, 1858, 236856, 53458832, 21494404400, 15580475076986, 20666605559464968, 50987322515860980236, 237747564913232367202656, 2125708395579372100915553094 (list; graph; listen)

	OFFSET	`4,2`
	REFERENCES	`Walsh, T. R. S.; Counting labeled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11.`
	CROSSREFS	`Cf. A054597.` `Adjacent sequences: A005640 A005641 A005642 this_sequence A005644 A005645 A005646` `Sequence in context: A005644 A123537 A054597 this_sequence A054853 A103642 A087616`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research