Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049373
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049373 Number of n-node planar graphs with minimum degree at least 5. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 5, 8, 30, 85, 392, 1587, 7659, 36309, 180642, 899574 (list; graph; listen)
OFFSET

1,16

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Adjacent sequences: A049370 A049371 A049372 this_sequence A049374 A049375 A049376

Sequence in context: A126700 A076593 A129774 this_sequence A002536 A068981 A099631

KEYWORD

nonn,nice,hard

AUTHOR

Brendan McKay (bdm(AT)cs.anu.edu.au)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research