A049370 - OEIS

This site is supported by donations to The OEIS Foundation.

A049370

Number of n-node planar graphs with minimum degree at least 2.

0, 0, 1, 3, 10, 50, 335, 3194, 39347, 579323, 9506939 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Sequence in context: A054381 A102088 A088142 * A009343 A048175 A192482` `Adjacent sequences: A049367 A049368 A049369 * A049371 A049372 A049373`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Brendan McKay (bdm(AT)cs.anu.edu.au)`

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

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.