Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002841
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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

Sequence in context: A151445 A000136 A013989 this_sequence A136509 A100664 A003446

Adjacent sequences: A002838 A002839 A002840 this_sequence A002842 A002843 A002844

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Definition corrected by Gordon Royle (gordon(AT)maths.uwa.edu.au), Dec 15 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research