cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A379887 Number of rational polygons with denominator at most n having exactly one lattice point in their interior, up to equivalence.

Original entry on oeis.org

16, 5145, 924042, 101267212, 8544548186
Offset: 1

Views

Author

Justus Springer, Jan 05 2025

Keywords

Comments

A379894 counts the polygons with the extra condition that the vertices are primitive. Both are in Classification 5.6 of the article by Bohnert and Springer.
An algorithm to compute a(n) was given by Timo Hummel in his dissertation. His final number for n = 3 (given in Theorem 12.1) was however slightly off.

Examples

			For n = 1, there are 16 lattice polygons with exactly one interior lattice point, which are the 16 reflexive lattice polygons.
		

Crossrefs

Showing 1-1 of 1 results.