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 A052453 #31 Feb 16 2025 08:32:42 %S A052453 1,1,1,1,1,1,18,3,1,1 %N A052453 Number of nonisomorphic (3,n) cage graphs. %C A052453 A (3,n) cage graph is a 3-regular (or cubic, or trivalent) graph which has girth n, and has the fewest possible number of vertices. - _Harry Richman_, Jan 14 2025 %H A052453 Andries E. Brouwer, <a href="http://www.win.tue.nl/~aeb/graphs/cages/cages.html">Cages</a> %H A052453 Geoffrey Exoo, <a href="https://web.archive.org/web/20200130194226/http://ginger.indstate.edu/ge/CAGES">Regular graphs of given degree and girth</a>. %H A052453 Geoffrey Exoo and Robert Jajcay, <a href="https://doi.org/10.37236/37">Dynamic cage survey</a>, Electr. J. Combin. (2008, 2011). %H A052453 Gordon Royle, <a href="http://staffhome.ecm.uwa.edu.au/~00013890/remote/cages/allcages.html">Cages of higher valency</a> %H A052453 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CageGraph.html">Cage Graph</a> (claims too much) %H A052453 Wikipedia, <a href="https://en.wikipedia.org/wiki/Cage_(graph_theory)">Cage (graph theory)</a> %e A052453 a(3) = 1 since the complete graph K_4 is the unique smallest cubic graph with girth 3. %e A052453 a(5) = 1 since the Petersen graph is the unique smallest cubic graph with girth 5. %e A052453 a(12) = 1 from the unique generalized hexagon of order 2. %Y A052453 Cf. A000066 (size of these graphs). %K A052453 nonn,more,hard %O A052453 3,7 %A A052453 _Eric W. Weisstein_ %E A052453 a(11) from _Brendan McKay_ and W. Myrvold