|
|
A007021
|
|
Number of 4-connected simplicial polyhedra with n nodes.
(Formerly M1214)
|
|
9
|
|
|
1, 1, 1, 1, 1, 2, 4, 10, 25, 87, 313, 1357, 6244, 30926, 158428, 836749, 4504607, 24649284, 136610879, 765598927, 4332047595, 24724362117, 142205424580, 823687567019, 4801749063379
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,6
|
|
COMMENTS
|
Also the number of 4-connected triangulations on n vertices. - Manfred Scheucher, Mar 17 2023
|
|
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.
H. Heesch, Ein zum Vierfarbensatz aquivalenter Satz der Panisochromie [ A theorem of panisochromaticity equivalent to the four color theorem ], pp. 229-253 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|