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 A322347 #6 Dec 06 2018 16:38:00 %S A322347 3,4,3,3,3,3,3,4,3,3,4,4,3,4,3,3,4,4,3,4,3,4,4,4,3,4,4,3,4,4 %N A322347 Minimal number of vertices of a convex lattice polygon of genus n, restricted to those polygons that are interior to another polygon. %C A322347 Without the restriction to polygons that are interior to another polygon, the minimal number of vertices is always 3. %D A322347 See A322343. %H A322347 Wouter Castryck, <a href="http://dx.doi.org/10.1007/s00454-011-9376-2">Moving Out the Edges of a Lattice Polygon</a>, Discrete Comput. Geom., 47 (2012), p. 496-518, Column n_min(1) in Table 1, p 512. %Y A322347 Cf. A322343. %K A322347 nonn,more %O A322347 1,1 %A A322347 _Hugo Pfoertner_, Dec 04 2018