A006866 - OEIS

This site is supported by donations to The OEIS Foundation.

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; 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).`
	CROSSREFS	`Sequence in context: A094812 A079992 A106519 * A121908 A097075 A036673` `Adjacent sequences: A006863 A006864 A006865 * A006867 A006868 A006869`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:26 EST 2012. Contains 205904 sequences.