|
Search: id:A002841
|
|
|
| A002841 |
|
Number of 3-connected self-dual planar graphs with 2n edges.
(Formerly M1615 N0631)
|
|
+0
2
|
|
| 1, 1, 2, 6, 16, 50, 165, 554, 1908, 6667, 23556
(list; graph; listen)
|
|
|
OFFSET
|
3,3
|
|
|
COMMENT
|
Also number of self-dual polyhedra with n+1 vertices (and n+1 faces). - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), 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.
P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.
|
|
CROSSREFS
|
Adjacent sequences: A002838 A002839 A002840 this_sequence A002842 A002843 A002844
Sequence in context: A052814 A000136 A013989 this_sequence A136509 A100664 A003446
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Definition corrected by Gordon Royle (gordon(AT)csse.uwa.edu.au), Dec 15 2005
|
|
|
Search completed in 0.002 seconds
|
