login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006866 Number of irreducible polyhedral graphs with n nodes.
(Formerly M0897)
0
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: A094812 A079992 A106519 * A121908 A231368 A245123

Adjacent sequences:  A006863 A006864 A006865 * A006867 A006868 A006869

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 19:54 EST 2018. Contains 317240 sequences. (Running on oeis4.)