%I #6 Dec 06 2018 16:38:00
%S 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 Minimal number of vertices of a convex lattice polygon of genus n, restricted to those polygons that are interior to another polygon.
%C Without the restriction to polygons that are interior to another polygon, the minimal number of vertices is always 3.
%D See A322343.
%H 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 Cf. A322343.
%K nonn,more
%O 1,1
%A _Hugo Pfoertner_, Dec 04 2018