VOOZH about

URL: https://oeis.org/A006867

⇱ A006867 - OEIS

login
A006867
Number of irreducible polyhedral graphs with n faces.
0
1, 2, 5, 20, 107, 826, 7703, 81231, 914973, 10772406
OFFSET
4,2
COMMENTS
A polyhedral graph is irreducible if it ceases to be 3-connected upon removal of any edge. - Andrey Zabolotskiy, Feb 28 2024
REFERENCES
M. B. Dillencourt, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, J. Comb. Theory, Ser. B, 66 (1996) 87-122.
CROSSREFS
Sequence in context: A261779 A227096 A152562 * A170946 A296727 A201224
KEYWORD
nonn,more
EXTENSIONS
a(13) from Dillencourt (1996) added by Andrey Zabolotskiy, Feb 28 2024
STATUS
approved