A006866 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A006866

Number of irreducible polyhedral graphs with n nodes.
(Formerly M0897)

1, 1, 2, 3, 9, 19, 71, 249, 1058, 4705, 22380

(list; graph; refs; listen; history; text; internal format)

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).

LINKS

Table of n, a(n) for n=4..14.

CROSSREFS

Sequence in context: A079992 A324374 A106519 * A121908 A231368 A369517

Adjacent sequences: A006863 A006864 A006865 * A006867 A006868 A006869

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved