%I #9 Sep 20 2019 04:45:34
%S 0,0,0,1,2,8,45,419,4798,62754,872411,12728018,192324654,2991463239,
%T 47663036427,775158142233,12831576165782
%N Number of isomorphism classes of 3-connected simple planar graphs (convex polytopes) where isomorphism does not allow reflection.
%C If reflection is allowed, the counts are A000944.
%H Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/">plantri and fullgen</a> programs for generation of certain types of planar graph.
%H Gunnar Brinkmann and Brendan McKay, <a href="/A000103/a000103_1.pdf">plantri and fullgen</a> programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
%H CombOS - Combinatorial Object Server, <a href="http://combos.org/plantri">generate planar graphs</a>
%Y Cf. A005470.
%K hard,nonn
%O 1,5
%A _Brendan McKay_, Jun 02 2006