The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319427 Number of cyclically 3-connected cubic planar graphs containing 2n nodes. 2
1, 31, 509, 6870, 80192 (list; graph; refs; listen; history; text; internal format)
OFFSET
12,2
LINKS
R. E. L. Aldred, S. Bau, D. A. Holton, Nonhamiltonian 3-connected cubic planar graphs, SIAM Journal on Discrete Mathematics, 13(1) (2000), 25-32. See Table 1.
D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory B vol 45, iss. 3 (1988) 305-319.
D. A. Holton and B. D. McKay, Erratum, J. Combinat. Theory B vol 47, iss. 2 (1989) 248.
CROSSREFS
Equals A319425 + A319426.
Sequence in context: A010983 A022595 A125488 * A241888 A316457 A278558
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Sep 26 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 19:55 EDT 2024. Contains 372919 sequences. (Running on oeis4.)