A007033 Number of non-Hamiltonian polyhedra with n nodes. (Formerly M5351)

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 74, 1600, 43984, 1032208, 22960220, 487869344, 10075818632

Offset

1,11

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=1..17.

Max Croucher, Computational methods for investigating the 3 longest paths problem in polyhedral graphs, University of Canterbury, 2025, Page 84.

M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, Journal of Combinatorial Theory, Series B, Volume 66, Issue 1, January 1996, Pages 87-122.

Eric Weisstein's World of Mathematics, Nonhamiltonian Graph

Eric Weisstein's World of Mathematics, Polyhedral Graph

Crossrefs

Sequence in context: A300487 A222861 A242146 * A277941 A017790 A035732

Adjacent sequences: A007030 A007031 A007032 * A007034 A007035 A007036

Keyword

nonn,hard

Author

N. J. A. Sloane

Extensions

a(15) from Sean A. Irvine, Sep 21 2017

a(16)-a(17) from Max Croucher, Sep 03 2025

Status

approved