login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Without the restriction to polygons that are interior to another polygon, the minimal number of points on the boundary is always 3.
REFERENCES
See A322343.
LINKS
Wouter Castryck, Moving Out the Edges of a Lattice Polygon, Discrete Comput. Geom., 47 (2012), p. 496-518, Column R_min(1) in Table 1, p 512.
CROSSREFS
Cf. A322343.
Sequence in context: A330912 A029912 A272756 * A205560 A195939 A331859
KEYWORD
nonn,more
AUTHOR
Hugo Pfoertner, Dec 04 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 02:29 EDT 2024. Contains 372317 sequences. (Running on oeis4.)