A007027 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A007027

Number of 4-connected polyhedral graphs with n nodes.
(Formerly M3402)

1, 0, 1, 1, 4, 10, 53, 292, 2224, 18493, 167504, 1571020, 15151289, 148864939, 1485904672, 15028654628, 153781899708, 1589921572902, 16591187039082

(list; graph; refs; listen; history; text; internal format)

OFFSET

4,5

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..22.

Jan Goedgebeur, Kenta Noguchi, Jarne Renders, and Carol T. Zamfirescu, HIST-Critical Graphs and Malkevitch's Conjecture, arXiv:2401.04554 [math.CO], 2024. See p. 9 and table 4.

CROSSREFS

Sequence in context: A109387 A362819 A018844 * A192444 A197902 A276123

Adjacent sequences: A007024 A007025 A007026 * A007028 A007029 A007030

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane

EXTENSIONS

a(16)-a(17) from Sean A. Irvine, Sep 19 2017

a(18)-a(22) from Goedgebeur et al. added by Andrey Zabolotskiy, Feb 27 2024

STATUS

approved