A054381 - OEIS

This site is supported by donations to The OEIS Foundation.

A054381

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

0, 0, 1, 3, 10, 49, 332 (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	`Cf. A049370.` `Sequence in context: A193281 A143921 A082426 * A102088 A088142 A049370` `Adjacent sequences: A054378 A054379 A054380 * A054382 A054383 A054384`
	KEYWORD	`nonn,hard`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

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

Last modified February 17 05:54 EST 2012. Contains 205985 sequences.