Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049369
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049369 Number of planar graphs with minimum degree at least 1 and n nodes. +0
1
0, 1, 2, 7, 22, 109, 680, 6144, 72887, 1061063, 17540092 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A005470.

Sequence in context: A150333 A057787 A004300 this_sequence A153523 A153551 A125285

Adjacent sequences: A049366 A049367 A049368 this_sequence A049370 A049371 A049372

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research