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 A377245 #15 Dec 20 2024 08:54:47 %S A377245 1,3,4,5,7,11,16,21,25,37,46,60,69,95,110,146,179,218,258,328,378,480, %T A377245 557,680,792,965,1090,1320,1549,1814,2091,2487,2839,3360,3809,4406, %U A377245 5062,5893,6594,7642,8705,9955,11254,12852,14395,16556,18588,20894,23535 %N A377245 Number of equivalence classes of convex lattice polygons containing n lattice points, restricting the count to those polygons that are interior to another polygon. %C A377245 See Castryck article for an explanation how to check if a polygon is interior to another polygon by application of theorem 5 (Koelman 1991). %C A377245 The polygons up to 112 lattice points can be downloaded from the zenodo dataset linked below. %H A377245 Justus Springer, <a href="/A377245/b377245.txt">Table of n, a(n) for n = 3..112</a> %H A377245 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. %H A377245 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 A377245 Justus Springer, <a href="https://github.com/justus-springer/RationalPolygons.jl">RationalPolygons.jl (Version 1.0.0) [Computer software]</a>, 2024. %H A377245 Justus Springer and Martin Bohnert, <a href="https://doi.org/10.5281/zenodo.13959996">Lattice polygons with at most 70 lattice points (1.1.0) [Data set]</a>, 2024. %Y A377245 Cf. A371917, A322343, A322344, A187015. %K A377245 nonn %O A377245 3,2 %A A377245 _Justus Springer_, Oct 21 2024