Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046091 Number of connected planar graphs with n edges. +0
3
1, 1, 1, 3, 5, 12, 30, 79, 227, 709, 2318 (list; graph; listen)
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.

Adjacent sequences: A046088 A046089 A046090 this_sequence A046092 A046093 A046094

Sequence in context: A005913 A056690 A066951 this_sequence A002905 A087610 A099791

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 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research