%I #16 Nov 15 2024 19:39:10

%S 1,3,10,61,564,7593,123874,2262877,44190279,904777809,19207129217,

%T 419870351012,9405626692325

%N Number of embeddings on the sphere of 2-connected planar graphs with n nodes.

%C The complete graph on two vertices is sometimes considered to be 2-connected (or nonseparable). Compare A002218 with A021103. - _Andrew Howroyd_, Mar 01 2021

%D R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

%H G. Brinkmann and B. D. McKay, Fast generation of planar graphs, MATCH Commun. Math. Comput. Chem, 58 (2007), 323-357. [<a href="http://users.cecs.anu.edu.au/%7Ebdm/papers/plantri-full.pdf">Expanded version</a>]

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PlanarEmbedding.html">Planar Embedding</a>.

%Y Row sums of A342060.

%Y Cf. A002218, A005142, A021103.

%K nonn,nice,more,changed

%O 3,2

%A Ronald C. Read

%E a(8)-a(15) added by _Mohammadreza Jooyandeh_, Sep 03 2013