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 A322350 #5 Dec 06 2018 16:38:20 %S A322350 3,5,5,6,7,6,7,8,8,8,8,8,9,9,9,9,9,10,9,9,10,10,10,10,10,11,9,10,11,11 %N A322350 Minimal number of points on the boundary of a convex lattice polygon of genus n, restricted to those polygons that are interior to another polygon. %C A322350 Without the restriction to polygons that are interior to another polygon, the minimal number of points on the boundary is always 3. %D A322350 See A322343. %H A322350 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 R_min(1) in Table 1, p 512. %Y A322350 Cf. A322343. %K A322350 nonn,more %O A322350 1,1 %A A322350 _Hugo Pfoertner_, Dec 04 2018