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 A330333 #22 Jun 02 2022 10:09:38
%S A330333 1,2,3,5,10,30,103,519
%N A330333 Number of diameter-2-critical graphs with n nodes.
%C A330333 The first 10 terms were obtained by filtering the list of non-isomorphic connected graphs, see McKay et al., 2013.
%H A330333 J. A. MacDougall and R. B. Eggleton, <a href="https://www.researchgate.net/publication/263930066_Triangle-free_and_Triangle-saturated_Graphs">Triangle-free and triangle-saturated Graphs</a>, Journal of Combinatorial Mathematics and Combinatorial Computing, 25:3-21, 1997.
%H A330333 B. D. McKay and A. Piperno, <a href="http://dx.doi.org/10.1016/j.jsc.2013.09.003">Practical Graph Isomorphism, II</a>, J. Symbolic Computation 60 (2013), 94-112.
%e A330333 The diameter-2-critical graphs for n=3,4,5 are K_{1,2}; K_{1,3}, C_4; K_{1,4}, K_{2,3}, C_5.
%K A330333 nonn,more
%O A330333 3,2
%A A330333 _Miodrag Zivkovic_, Dec 17 2019