login
Number of unsensed 2-connected planar maps with n edges.
(Formerly M1157)
2

%I M1157 #20 Mar 28 2021 10:39:32

%S 1,1,2,4,8,20,58,177,630,2410,9772,41423,181586,814412,3722445

%N Number of unsensed 2-connected planar maps with n edges.

%C Equivalently, a(n) is the number of embeddings on the sphere of 2-connected planar graphs with n edges. - _Andrew Howroyd_, Mar 27 2021

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Timothy R. Walsh, <a href="http://dx.doi.org/10.1137/0604018">Generating nonisomorphic maps without storing them</a>, SIAM J. Algebraic Discrete Methods 4 (1983), no. 2, 161-178.

%F a(n) = Sum_{k=3..n} A342060(k, n+2-k). - _Andrew Howroyd_, Mar 27 2021

%Y Cf. A006403, A006405, A006406 (sensed case), A342060.

%K nonn,more

%O 3,3

%A _N. J. A. Sloane_

%E a(11) and a(12) from _Sean A. Irvine_, Apr 03 2017

%E a(13)-a(17) from _Andrew Howroyd_, Mar 27 2021