

A002841


Number of 3connected selfdual planar graphs with 2n edges.
(Formerly M1615 N0631)


1



1, 1, 2, 6, 16, 50, 165, 554, 1908, 6667, 23556
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

3,3


COMMENTS

Also number of selfdual polyhedra with n+1 vertices (and n+1 faces).  Franklin T. AdamsWatters, Dec 18 2006


REFERENCES

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 9291, 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

Table of n, a(n) for n=3..13.
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 87122. See bottom of Table IV on page 98.
P. J. Federico, Enumeration of polyhedra: the number of 9hedra, J. Combin. Theory, 7 (1969), 155161.


CROSSREFS

Cf. A000944.
Sequence in context: A195645 A000136 A013989 * A136509 A100664 A258797
Adjacent sequences: A002838 A002839 A002840 * A002842 A002843 A002844


KEYWORD

nonn,nice,more


AUTHOR

N. J. A. Sloane


EXTENSIONS

Definition corrected by Gordon F. Royle, Dec 15 2005


STATUS

approved



