Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Dec 17 2016 10:27:33
%S 1,1,3,11,57,375,3398,40043,585440,9895493
%N Number of rooted connected unlabeled planar graphs on n nodes.
%C Number of "pointed" connected planar graphs on n nodes: number of pairs (G,P) where G is a connected unlabeled planar graph with n nodes and P runs through the orbit representatives of nodes in G under the action of Aut(G).
%C For n <= 4 this agrees with A126100; a(5) = A126100(5) - 1 = 57, since K_5 is the only excluded graph on 5 nodes.
%Y Cf. A005470, A039735, A126100.
%K nonn,more
%O 1,3
%A _David Applegate_ and _N. J. A. Sloane_, Mar 09 2007
%E a(6)-a(10) from _Brendan McKay_, Mar 10 2007