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 A339546 #10 Dec 09 2020 09:19:48 %S A339546 1,1,1,1,1,1,1,1,1,1,1,1,2,3,6,6,15,17,40,45,89,116,199,271 %N A339546 Number of at least 3-connected planar triangulations on n vertices such that the minimum valence of any vertex in the mesh is maximized and the number of vertices with this minimum valence is minimized. %C A339546 It is conjectured that for a polyhedron with maximum possible volume inscribed in a sphere the stated condition is necessary. All known polyhedra with conjecturally maximum volume satisfy this condition. For n <= 15 the given condition determines a unique mesh topology for each n, which coincides with the proved optimal solutions for n <= 8. %D A339546 See A081314 for references and links. %H A339546 Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/">plantri and fullgen</a> programs for generation of certain types of planar graph. %H A339546 Hugo Pfoertner, <a href="/A339546/a339546.txt">Construction of sequence</a>, table of vertex degrees of triangulations (2020). %Y A339546 Cf. A081314, A081621, A339260, A339261, A339262, A339263. %K A339546 nonn,more %O A339546 4,13 %A A339546 _Hugo Pfoertner_, Dec 08 2020