id:A049372 - OEIS Search Results

Search: id:A049372

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, 0, 0, 1, 1, 4, 14, 69, 444, 3702, 33505, 325761, 3257898 (list; graph; listen)

	OFFSET	`1,8`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Sequence in context: A014512 A065606 A005501 this_sequence A050549 A167144 A159483` `Adjacent sequences: A049369 A049370 A049371 this_sequence A049373 A049374 A049375`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Brendan McKay (bdm(AT)cs.anu.edu.au)`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.