The OEIS is supported by the many generous donors to the OEIS Foundation.
%I M1527 #11 Feb 28 2024 09:39:18
%S 1,2,5,20,107,826,7703,81231,914973,10772406
%N Number of irreducible polyhedral graphs with n faces.
%C A polyhedral graph is irreducible if it ceases to be 3-connected upon removal of any edge. - _Andrey Zabolotskiy_, Feb 28 2024
%D M. B. Dillencourt, personal communication.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H M. B. Dillencourt, <a href="https://doi.org/10.1006/jctb.1996.0008">Polyhedra of small orders and their Hamiltonian properties</a>, J. Comb. Theory, Ser. B, 66 (1996) 87-122.
%Y Cf. A006866, A000944.
%K nonn,more
%O 4,2
%A _N. J. A. Sloane_
%E a(13) from Dillencourt (1996) added by _Andrey Zabolotskiy_, Feb 28 2024