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!)
A322347 Minimal number of vertices of a convex lattice polygon of genus n, restricted to those polygons that are interior to another polygon. 1
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 (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 vertices 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 n_min(1) in Table 1, p 512.
CROSSREFS
Cf. A322343.
Sequence in context: A038774 A092910 A356334 * A073322 A006197 A079404
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 April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)