Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054381
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054381 Number of n-node connected planar graphs with minimum degree at least 2. +0
1
0, 0, 1, 3, 10, 49, 332 (list; graph; listen)
OFFSET

1,4
LINKS

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

CROSSREFS

Cf. A049370.

Sequence in context: A005921 A143921 A082426 this_sequence A102088 A088142 A049370

Adjacent sequences: A054378 A054379 A054380 this_sequence A054382 A054383 A054384

KEYWORD

nonn,hard

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

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 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.