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 A349402 #30 May 20 2024 11:46:28 %S A349402 0,0,0,0,1,1,4,15,168,2252,94504 %N A349402 Number of distance-critical graphs on n vertices. %C A349402 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. %H A349402 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. 3. %e A349402 The unique distance-critical graphs on 5 and 6 vertices are the cycles. %Y A349402 Cf. A004108. %K A349402 nonn,more %O A349402 1,7 %A A349402 _Gabrielle Tauscheck_, Nov 15 2021