OFFSET
3,2
COMMENTS
A322343 counts the polygons by their number of interior lattice points, excluding points on the boundary.
LINKS
Justus Springer, Table of n, a(n) for n = 3..112
Martin Bohnert and Justus Springer, Classifying rational polygons with small denominator and few interior lattice points, arXiv:2410.17244 [math.CO], 2024. See p. 20.
R. J. Koelman, The number of moduli families of curves on toric surfaces, Dissertation (1991), Chapter 4.4.
Justus Springer, RationalPolygons.jl (Version 1.0.0) [Computer software], 2024.
Justus Springer and M. Bohnert, Lattice polygons with at most 70 lattice points (1.0.0) [Data set], 2024.
EXAMPLE
For n = 3, the only polygon is the standard triangle with vertices (0,0), (1,0) and (0,1).
For n = 4, a(4) = 3 and the three polygons have vertex sets {(1,0),(0,1),(-1,-1)}, {(0,0),(2,0),(0,1)} and {(0,0),(1,0),(0,1),(1,1)}.
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Justus Springer, Apr 12 2024
STATUS
approved