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 A371674 #14 May 20 2024 11:46:23 %S A371674 0,0,0,0,1,1,2,4,14,82,557 %N A371674 Number of maximal distance-critical graphs on n vertices. %C A371674 A distance-critical graph is considered to be a connected graph such that no vertex can be deleted without altering the distance metric on the remaining vertices. A maximal distance-critical graph is considered to be a distance critical graph such that the addition of any edge or edges will no longer result in a distance critical graph. %H A371674 Joshua Cooper and Gabrielle Tauscheck, <a href="https://arxiv.org/abs/2405.09656">Distance Critical Graphs</a>, arXiv:2405.09656 [math.CO], 2024. See p. 10. %e A371674 The unique maximal distance-critical graphs on 5 and 6 vertices are the cycles. %Y A371674 Cf. A349402. %K A371674 nonn,more %O A371674 1,7 %A A371674 _Gabrielle Tauscheck_, Apr 02 2024