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 A359704 #22 Feb 17 2023 22:28:52 %S A359704 16,45,75,209,336,928,1445,3965,6000,16555 %N A359704 Minimum number of spanning trees in a 3-connected graph on n nodes. %C A359704 The initial terms were found through generating all minimally 3-connected graphs with n vertices for n up to 13 (the 3-connected graphs with fewest spanning trees are minimally 3-connected). %H A359704 David Kofoed Wind, <a href="/A006290/a006290.pdf">Connected Graphs with Fewest Spanning Trees</a>, Bachelor Thesis, Spring 2011. %e A359704 a(4) = 16 which is the number of spanning trees in the complete graph on 4 nodes. %Y A359704 Cf. A006290 (3-connected graphs), A199676 (minimally 3-connected graphs). %K A359704 nonn,more %O A359704 4,1 %A A359704 _David Kofoed Wind_, Jan 11 2023