Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049370
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049370 Number of n-node planar graphs with minimum degree at least 2. +0
2
0, 0, 1, 3, 10, 50, 335, 3194, 39347, 579323, 9506939 (list; graph; listen)
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 this_sequence A009343 A048175 A020132

Adjacent sequences: A049367 A049368 A049369 this_sequence A049371 A049372 A049373

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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research