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 A348638 #42 Jan 20 2023 18:05:33 %S A348638 1,2,3,5,7,9,11,13 %N A348638 Minimal order of a graph containing as induced subgraphs isomorphic copies of all trees on n unlabeled nodes. %C A348638 a(n) is the minimal order of an induced universal graph for the family of trees on n vertices. %C A348638 a(9) <= 15 and a(10) <= 18 (Trimble, 2021). %H A348638 James Trimble, <a href="https://arxiv.org/abs/2109.00075">Induced universal graphs for families of small graphs</a>, arXiv:2109.00075 [math.CO], 2021. %H A348638 James Trimble, <a href="http://dx.doi.org/10.5525/gla.thesis.83350">Partitioning algorithms for induced subgraph problems</a>, Ph.D. Thesis, Univ. of Glasgow (Scotland, 2023), 134. %Y A348638 Cf. A004401, A097911. %K A348638 nonn,more %O A348638 1,2 %A A348638 _James Trimble_, Nov 09 2021