This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A364404 #15 Jun 02 2024 11:05:19 %S A364404 0,0,0,0,1,4,29,186,1435,12671,131820,1590900,21940512,339723835 %N A364404 Number of (strictly) 1-connected cubic graphs on 2n nodes. %H A364404 G. Brinkmann, J. Goedgebeur and B. D. McKay, <a href="https://caagt.ugent.be/cubic/">snarkhunter</a>. %e A364404 For n=5, the unique 10-node cubic graph that is strictly 1-connected is: %e A364404 o o %e A364404 /|\ /|\ %e A364404 o-o o-o o-o %e A364404 \|/ \|/ %e A364404 o o %o A364404 (nauty) # The snarkhunter program (see Links) has an option "C2" for (at least) 2-connectivity. So a(n) is the difference between the outputs from "./snarkhunter X 3 ns" and "./snarkhunter X 3 ns C2", where X=2n. %Y A364404 Cf. A204199, A204198, A002851. %K A364404 nonn,more %O A364404 1,6 %A A364404 _Ed Wynn_, Jul 22 2023