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 A108941 #8 Jan 17 2020 03:30:15 %S A108941 16,81,392,2000,9800,50421,248832,1265625,6422000,32710656 %N A108941 Maximum number of spanning trees in a cubic graph on 2n vertices. %C A108941 a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph. %e A108941 When n=2, the only cubic graph on 2n vertices is the complete graph K4 with 16 spanning trees. %Y A108941 Cf. A020871. %K A108941 nonn,more %O A108941 2,1 %A A108941 _Gordon F. Royle_, Jul 20 2005