A002841 Number of 3-connected self-dual planar graphs with 2n edges.

1, 1, 2, 6, 16, 50, 165, 554, 1908, 6667, 23556, 84048, 302404, 1095536, 3993623

Offset: 3

Author

N. J. A. Sloane

Keywords

• nonn
• nice
• more

Comments

Also number of self-dual polyhedra with n+1 vertices (and n+1 faces). - Franklin T. Adams-Watters, Dec 18 2006

References

• M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
• N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• C. J. Bouwkamp & N. J. A. Sloane, Correspondence, 1971
• M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, Journal of Combinatorial Theory, Series B, Volume 66, Issue 1, January 1996, Pages 87-122. See bottom of Table IV on page 98.
• P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.
• House of Graphs, Planar graphs
• Eric Weisstein's World of Mathematics, Self-Dual Graph

Crossrefs

Cf. A000944.

Extensions

Definition corrected by Gordon F. Royle, Dec 15 2005

a(14)-a(17) added by Jan Goedgebeur, Sep 16 2021