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 A370003 #10 Feb 11 2024 09:15:21 %S A370003 1,2,4,7,9 %N A370003 Least number of vertices of a universal graph for connected n-vertex graphs, i.e., a graph containing as induced subgraphs isomorphic copies of all connected n-vertex graphs. %H A370003 Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/75209/">What is the smallest graph that contains all non-isomorphic 4-node and 5-node connected graphs as induced subgraphs?</a> %H A370003 Wikipedia, <a href="https://en.wikipedia.org/wiki/Universal_graph">Universal graph</a>. %Y A370003 Cf. A097911, A370002. %K A370003 nonn,more %O A370003 1,2 %A A370003 _Pontus von Brömssen_, Feb 08 2024