id:A049371 - OEIS Search Results

Search: id:A049371

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, 1, 2, 9, 46, 386, 3900, 48766, 670392, 9845024 (list; graph; listen)

	OFFSET	`1,5`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Cf. A005470.` `Sequence in context: A161798 A134091 A032331 this_sequence A032079 A002395 A042793` `Adjacent sequences: A049368 A049369 A049370 this_sequence A049372 A049373 A049374`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Brendan McKay (bdm(AT)cs.anu.edu.au)`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.