%I A002841 M1615 N0631
%S A002841 1,1,2,6,16,50,165,554,1908,6667,23556
%N A002841 Number of 3-connected self-dual planar graphs with 2n edges.
%C A002841 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
%D A002841 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002841 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002841 M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. 
               Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 
               1992.
%D A002841 P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. 
               Theory, 7 (1969), 155-161.
%Y A002841 Sequence in context: A151445 A000136 A013989 this_sequence A136509 A100664 
               A003446
%Y A002841 Adjacent sequences: A002838 A002839 A002840 this_sequence A002842 A002843 
               A002844
%K A002841 nonn,nice
%O A002841 3,3
%A A002841 N. J. A. Sloane (njas(AT)research.att.com).
%E A002841 Definition corrected by Gordon Royle (gordon(AT)maths.uwa.edu.au), Dec 
               15 2005