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 A212555 #15 Jan 14 2021 06:15:54 %S A212555 0,1,2,4,6,8,11,14,17,21,25 %N A212555 Values of ||G*(n)|| related to construction of graphs which contain all small trees. %H A212555 Chung, F. R. K.; Graham, R. L. <a href="https://doi.org/10.1016/0095-8956(78)90072-2">On graphs which contain all small trees</a>. J. Combinatorial Theory Ser. B 24 (1978), no. 1, 14--23. MR0505812 (58 #21808a) %Y A212555 This is an upper bound on A004401. %Y A212555 Cf. A339573. %K A212555 nonn,more %O A212555 0,3 %A A212555 _N. J. A. Sloane_, May 26 2012