[go: up one dir, main page]

login
A006385
Number of connected planar maps with n edges.
(Formerly M1279)
10
1, 2, 4, 14, 52, 248, 1416, 9172, 66366, 518868, 4301350, 37230364, 333058463, 3057319072, 28656583950, 273298352168, 2645186193457, 25931472185976
OFFSET
0,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
T. R. S. Walsh, personal communication.
LINKS
Richard Kapolnai, Gabor Domokos, and Timea Szabo, Generating spherical multiquadrangulations by restricted vertex splittings and the reducibility of equilibrium classes, Periodica Polytechnica Electrical Engineering, 56(1):11-10, 2012. Also arXiv:1206.1698, 2012. See Table 2.
V. A. Liskovets, A reductive technique for enumerating nonisomorphic planar maps, Discr. Math., v.156 (1996), 197-217.
Walsh, T. R. S., Generating nonisomorphic maps without storing them, SIAM J. Algebraic Discrete Methods 4 (1983), no. 2, 161-178.
T. R. Walsh, Space-Efficient Generation of Nonisomorphic Maps and Hypermaps, J. Int. Seq. 18 (2015) # 15.4.3
Wormald, Nicholas C. Counting unrooted planar maps, Discrete Math. 36 (1981), no. 2, 205-225.
CROSSREFS
KEYWORD
nonn,nice
STATUS
approved