login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS Foundation is grateful to everyone who made a donation during our Annual Appeal.     Visit the new and spectacular Pictures from the OEIS page!

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002841 Number of 3-connected self-dual 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 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.

P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.

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.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 6 01:00 EST 2016. Contains 268029 sequences.