login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006866
Number of irreducible polyhedral graphs with n nodes.
(Formerly M0897)
1
1, 1, 2, 3, 9, 19, 71, 249, 1058, 4705, 22380
OFFSET
4,3
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.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
CROSSREFS
Sequence in context: A079992 A324374 A106519 * A121908 A231368 A369517
KEYWORD
nonn
AUTHOR
STATUS
approved