cp's OEIS Frontend

A005470 Number of unlabeled planar simple graphs with n nodes.

%I A005470 M1252 #66 Feb 16 2025 08:32:28
%S A005470 1,1,2,4,11,33,142,822,6966,79853,1140916,18681008,333312451
%N A005470 Number of unlabeled planar simple graphs with n nodes.
%C A005470 Euler transform of A003094. - _Christian G. Bower_
%D A005470 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D A005470 W. T. Trotter, ed., Planar Graphs, Vol. 9, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Amer. Math. Soc., 1993.
%D A005470 Turner, James; Kautz, William H. A survey of progress in graph theory in the Soviet Union. SIAM Rev. 12 1970 suppl. iv+68 pp. MR0268074 (42 #2973). See p. 19. - _N. J. A. Sloane_, Apr 08 2014
%D A005470 Vetukhnovskii, F. Ya. "Estimate of the Number of Planar Graphs." In Soviet Physics Doklady, vol. 7, pp. 7-9. 1962. - From _N. J. A. Sloane_, Apr 08 2014
%D A005470 R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972, p. 162.
%H A005470 G. Brinkmann, and B. D. McKay, <a href="http://users.cecs.anu.edu.au/~bdm/papers/plantri-full.pdf">Fast generation of planar graphs</a>, MATCH Commun. Math. Comput. Chem., 58 (2007) 323-357.
%H A005470 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 A005470 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 A005470 E. Friedman, <a href="/A000088/a000088a.gif">Illustration of small graphs</a>
%H A005470 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A005470 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PlanarGraph.html">Planar Graph</a>
%H A005470 <a href="/index/Cor#core">Index entries for "core" sequences</a>
%e A005470 a(2) = 2 since o o and o-o are the two planar simple graphs on two nodes.
%t A005470 A003094 = Cases[Import["https://oeis.org/A003094/b003094.txt", "Table"], {_, _}][[All, 2]];
%t A005470 (* EulerTransform is defined in A005195 *)
%t A005470 EulerTransform[Rest @ A003094] (* Jean-François Alcover, Apr 25 2013, updated Mar 17 2020 *)
%Y A005470 Cf. A003094 (connected planar graphs), A034889, A039735 (planar graphs by nodes and edges).
%Y A005470 Cf. A126201.
%K A005470 nonn,core,nice,hard,more
%O A005470 0,3
%A A005470 _N. J. A. Sloane_
%E A005470 n=8 term corrected and n=9..11 terms calculated by _Brendan McKay_
%E A005470 Terms a(0) - a(10) confirmed by _David Applegate_ and _N. J. A. Sloane_, Mar 09 2007
%E A005470 a(12) added by _Vaclav Kotesovec_ after A003094 (computed by _Brendan McKay_), Dec 06 2014