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-2 of 2 results.

A288248 Number of essentially different simple n-sided lattice polygons with minimum area subject to the conditions of A288247.

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 1, 3, 2, 10, 6, 5, 11, 4, 11, 19, 17, 55
Offset: 3

Views

Author

Hugo Pfoertner, Jun 07 2017

Keywords

Comments

Polygons differing only by rotation and/or reflection are counted only once.

Links

Crossrefs

Cf. A288247, A288250.

Extensions

Based on an exhaustive search performed by Michael Collier, a(12) corrected by Hugo Pfoertner, Jun 10 2017

A288249 2 * largest possible area of a simple n-sided lattice polygon whose vertex coordinates x and y are both independent permutations of the integers 1 ... n, subject to the condition that none of its edges are mutually parallel.

Original entry on oeis.org

3, 8, 18, 28, 44, 65, 88, 118, 151, 189, 226, 272, 323, 377, 433, 493, 558, 627, 701, 778, 860, 945, 1034, 1127, 1224, 1325
Offset: 3

Views

Author

Hugo Pfoertner, Jun 07 2017

Keywords

Comments

It is conjectured that a(n) = 2*n^2 - 9*(n-1) for all n>22.

References

  • For references and links see A288247.

Crossrefs

Cf. A288247, A288250.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.