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 A324264 #13 Feb 01 2025 23:18:03 %S A324264 1,1,1,2,5,28,223,3151,79673,3853870 %N A324264 Number of simple connected graphs on n unlabeled nodes with diameter equal to radius. %C A324264 When the graph diameter is equal to the radius, every node has the same eccentricity and is in both the graph center and the graph periphery. %H A324264 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphCenter.html">Graph Center</a>. %H A324264 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphPeriphery.html">Graph Periphery</a>. %H A324264 Wikipedia, <a href="https://en.wikipedia.org/wiki/Distance_(graph_theory)">Distance (graph theory)</a>. %Y A324264 Rightmost diagonal of A294525 and A324244. %K A324264 nonn,more %O A324264 1,4 %A A324264 _Andrew Howroyd_, Sep 02 2019