|
| |
|
|
A002880
|
|
Number of 3-connected nets with n edges.
(Formerly M0381 N0143)
|
|
5
| |
|
|
1, 0, 1, 1, 2, 2, 9, 11, 37, 79, 249, 671, 2182, 6692, 22131, 72405, 243806, 822788, 2815119, 9679205, 33551192, 116900081, 409675567, 1442454215, 5102542680, 18124571838, 64634480340, 231334873091, 830828150081, 2993489821771
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 6,5
|
|
|
REFERENCES
| Gunnar Brinkmann, Sam Greenberg, Catherine Greenhill, Brendan D. McKay, Robin Thomas and Paul Wollan, Generation of simple quadrangulations of the sphere, Discr. Math., 305 (2005), 33-54.
M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Journal of Combinatorial Theory, Series B, 66 (1996) 87-122.
P. J. Federico, Enumeration of polyhedra: the number of 9-hedra, J. Combin. Theory, 7 (1969), 155-161.
N. D. Kazarinoff and R. Weitzenkamp, Squaring rectangles and squares, Amer. Math. Monthly, 80 (1973), 877-888.
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
| G. Brinkmann et al., Generation of simple quadrangulations of the sphere
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
|
|
|
CROSSREFS
| Cf. A113201, A078666, A007022.
Sequence in context: A193726 A143022 A154100 * A066324 A143146 A185755
Adjacent sequences: A002877 A002878 A002879 * A002881 A002882 A002883
|
|
|
KEYWORD
| nonn,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
