%I A046091
%S A046091 1,1,1,3,5,12,30,79,227,709,2318
%N A046091 Number of connected planar graphs with n edges.
%H A046091 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PlanarConnectedGraph.html">Link to a section of The World of Mathematics.</
               a>
%e A046091 a(3) = 3 since the three connected graphs with three edges are a path, 
               a triangle and a "Y".
%e A046091 The first difference between this sequence and A002905 is for n=9 edges 
               where we see K_{3,3}, the "utility graph".
%Y A046091 Cf. A002905, A066951.
%Y A046091 Sequence in context: A005913 A056690 A066951 this_sequence A002905 A087610 
               A156436
%Y A046091 Adjacent sequences: A046088 A046089 A046090 this_sequence A046092 A046093 
               A046094
%K A046091 nonn,nice,hard
%O A046091 0,4
%A A046091 Brendan McKay (bdm(AT)cs.anu.edu.au)