OFFSET
1,5
COMMENTS
The snarkhunter program (see Links) has options "C2" and "C3" for (at least) 2- and 3-connectivity respectively. So a(n) is the difference between the outputs from "./snarkhunter X 3 n C2" and "./snarkhunter X 3 n C3", where X=2n. - Ed Wynn, Jul 22 2023
LINKS
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.
EXAMPLE
From Ed Wynn, Jul 22 2023: (Start)
For n=4, the unique 8-node cubic graph that is strictly 2-connected is:
o-o
/| |\
o-o o-o
\| |/
o-o
(End)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jan 12 2012
EXTENSIONS
a(8)-a(14) from Ed Wynn, Jul 22 2023
STATUS
approved