A006867 Number of irreducible polyhedral graphs with n faces. (Formerly M1527)

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

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

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, J. Comb. Theory, Ser. B, 66 (1996) 87-122.

Crossrefs

Cf. A006866, A000944.

Sequence in context: A261779 A227096 A152562 * A170946 A296727 A201224

Adjacent sequences: A006864 A006865 A006866 * A006868 A006869 A006870

Keyword

nonn,more

Author

N. J. A. Sloane

Extensions

a(13) from Dillencourt (1996) added by Andrey Zabolotskiy, Feb 28 2024

Status

approved