A204198 Number of (strictly) 3-connected cubic graphs on 2n nodes.

0, 1, 2, 4, 14, 57, 341, 2828, 30468, 396150, 5909292, 98101019, 1782392646, 35085504243

Offset

1,3

Links

Table of n, a(n) for n=1..14.

G. Brinkmann, J. Goedgebeur and B. D. McKay, snarkhunter.

F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.

J. P. Costalonga, R. J. Kingan, and S. R. Kingan, Constructing minimally 3-connected graphs, arXiv:2012.12059 [math.CO], 2020-2021; Algorithms 14, no. 1: 9.

Prog

The snarkhunter program (see Links) has an option "C3" for (at least) 3-connectivity. So a(n) is output from "./snarkhunter X 3 n C3", where X=2n.

Crossrefs

Cf. A002851, A204199, A364404.

Sequence in context: A030958 A030885 A006384 * A003322 A170939 A030952

Adjacent sequences: A204195 A204196 A204197 * A204199 A204200 A204201

Keyword

nonn,more

Author

N. J. A. Sloane, Jan 12 2012

Extensions

a(8)-a(10) from S. R. Kingan, Jan 08 2021

a(11)-a(14) from Ed Wynn, Jul 22 2023

Status

approved