

A046091


Number of connected planar graphs with n edges.


4



1, 1, 1, 3, 5, 12, 30, 79, 227, 709, 2318, 8049, 29372, 112000, 444855, 1833072, 7806724, 34252145, 154342391, 712231465
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


LINKS

Table of n, a(n) for n=0..19.
B. D. McKay and A. Piperno, Practical Graph Isomorphism, II, J. Symbolic Computation, 60 (2014), pp. 94112.
Eric Weisstein's World of Mathematics, Planar Connected Graph.


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: A317580 A066951 A295065 * A002905 A220832 A323270
Adjacent sequences: A046088 A046089 A046090 * A046092 A046093 A046094


KEYWORD

nonn,nice,hard,more


AUTHOR

Brendan McKay


EXTENSIONS

a(11)a(19) from Martin Fuller using nauty by Brendan McKay, Mar 07 2015


STATUS

approved



