login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A046091 Number of connected planar graphs with n edges. 4
1, 1, 1, 3, 5, 12, 30, 79, 227, 709, 2318 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

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

EXAMPLE

a(3) = 3 since the three connected graphs with three edges are a path, a triangle and a "Y".

The first difference between this sequence and A002905 is for n=9 edges where we see K_{3,3}, the "utility graph".

CROSSREFS

Cf. A002905, A066951.

Sequence in context: A005913 A056690 A066951 * A002905 A087610 A191636

Adjacent sequences:  A046088 A046089 A046090 * A046092 A046093 A046094

KEYWORD

nonn,nice,hard

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:46 EST 2012. Contains 206011 sequences.