The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A366409 Number of smooth convex lattice polygons with area n/2. 2
 1, 1, 1, 3, 2, 4, 4, 6, 5, 7, 7, 9, 7, 12, 12, 15, 9, 15, 16, 18, 13, 23, 21, 24, 19, 26, 25, 30, 22, 39, 34, 34, 27, 46, 42, 41, 35, 60, 53, 56, 41, 63, 61, 62, 61, 91, 66, 72, 78, 111, 87, 86, 83, 135, 123, 111, 97, 142, 135, 156, 146, 176, 148, 186, 194, 206, 169, 200, 242, 313 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS A lattice polygon is a polygon whose vertices have integer coordinates. (They belong to the integer lattice or grid Z x Z). A convex lattice polygon is smooth if, for every vertex V, the adjacent lattice points on the two incident edges (which are not necessarily vertices) form together with V a triangle of area 1/2. LINKS Günter Rote, Table of n, a(n) for n = 1..300 (first 50 terms from Balletti (2021), Table 2 on p. 1114). Gabriele Balletti, Enumeration of lattice polytopes by their volume, Discrete Comput. Geom., 65 (2021), 1087-1122. Gabriele Balletti, Dataset of "small" lattice polytopes (2018). T. Bogart, C. Haase, M. Hering, B. Lorenz, B. Nill, A. Paffenholz, G. Rote, F. Santos, and H. Schenck, Finitely many smooth d-polytopes with n lattice points, Israel Journal of Mathematics 207 (2015), 301-329; and arXiv version, arXiv:1010.3887 [math.AG], 2010-2013. Günter Rote, Python program to count convex lattice polygons up to a given area (2023). Günter Rote, Number of smooth lattice polygons of area at most 150, classified by the number k of vertices, the number B of lattice points on edges, and the number I of interior lattice points. EXAMPLE Here is a smooth lattice polygon with k=6 vertices (V), 2 lattice points on edges (B), 2 interior lattice points (I), and area 5, shown as part of the grid: (The edges of the polygon are not drawn.) V--V--+--+--+ | | | | | V--I--B--+--+ | | | | | +--V--I--B--+ | | | | | +--+--+--V--V See Bogart et al., Theorem 32, and Appendix, p. 325, for a list of all 41 (convex) smooth lattice polygons with at most 12 lattice points, with figures. The dataset of Balletti gives the complete set of 1530 polygons up to area 25. Beware that the vertices are not always listed in sorted (clockwise or counterclockwise) order around the polygon boundary. PROG (Python) see the links section. CROSSREFS Cf. A187015 for lattice polygons without the smoothness restriction. Cf. A127709. Sequence in context: A145815 A059851 A327637 * A345082 A047993 A033177 Adjacent sequences: A366406 A366407 A366408 * A366410 A366411 A366412 KEYWORD nonn AUTHOR Günter Rote, Oct 09 2023 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.

Last modified May 19 00:35 EDT 2024. Contains 372666 sequences. (Running on oeis4.)