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 A371917 #22 Oct 27 2024 12:12:29
%S A371917 1,3,6,13,21,41,67,111,175,286,419,643,938,1370,1939,2779,3819,5293,
%T A371917 7191,9752,12991,17321,22641,29687,38533,49796,63621,81300,102807,
%U A371917 129787,162833,203642,252898,313666,386601,475540,582216,710688,863552,1048176
%N A371917 Number of inequivalent convex lattice polygons containing n lattice points (including points on the boundary).
%C A371917 A322343 counts the polygons by their number of interior lattice points, excluding points on the boundary.
%H A371917 Justus Springer, <a href="/A371917/b371917.txt">Table of n, a(n) for n = 3..112</a>
%H A371917 Martin Bohnert and Justus Springer, <a href="https://arxiv.org/abs/2410.17244">Classifying rational polygons with small denominator and few interior lattice points</a>, arXiv:2410.17244 [math.CO], 2024. See p. 20.
%H A371917 R. J. Koelman, <a href="https://hdl.handle.net/2066/113957">The number of moduli families of curves on toric surfaces</a>, Dissertation (1991), Chapter 4.4.
%H A371917 Justus Springer, <a href="https://github.com/justus-springer/RationalPolygons.jl">RationalPolygons.jl (Version 1.0.0) [Computer software]</a>, 2024.
%H A371917 Justus Springer and M. Bohnert, <a href="https://doi.org/10.5281/zenodo.13951425">Lattice polygons with at most 70 lattice points (1.0.0) [Data set]</a>, 2024.
%e A371917 For n = 3, the only polygon is the standard triangle with vertices (0,0), (1,0) and (0,1).
%e A371917 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)}.
%Y A371917 Cf. A187015, A322343, A322344.
%K A371917 nonn
%O A371917 3,2
%A A371917 _Justus Springer_, Apr 12 2024