This site is supported by donations to The OEIS Foundation.



Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070911 a(n) is twice the least possible area enclosed by a convex lattice n-gon. 2
1, 2, 5, 6, 13, 14, 21, 28 (list; graph; refs; listen; history; text; internal format)



A convex lattice n-gon is a polygon whose n vertices are points on the integer lattice Z^2 and whose interior angles are strictly less than Pi.

Sequence continues 1, 2, 5, 6, 13, 14, 21, 28, [39-43], 48, 65, 80


Table of n, a(n) for n=3..10.

Barany & Norihide, The minimum area of convex lattice n-gons

Cai, On the minimum area of convex lattice polygons

S. Rabinowitz, O(n^3) bounds for the area of a convex lattice n-gon, Geombinatorics, vol.II, 4(1993), p. 85-88.

R. J. Simpson, Convex lattice polygons of minimum area, Bulletin of the Australian Math. Society, 42 (1990), p. 353-367.


a(n)/2 = A063984(n) + n/2 - 1. [Simpson]

See Barany & Norihide for asymptotics.


See A089187 for the even-indexed subsequence. See A063984 for further information.

Sequence in context: A232603 A069480 A100613 * A113240 A098376 A028259

Adjacent sequences:  A070908 A070909 A070910 * A070912 A070913 A070914




Pierre Bornsztein (pbornszt(AT)club-internet.fr), May 20 2002


Additional comments from S. R. Finch, Dec 06 2003



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

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

Last modified December 22 10:11 EST 2014. Contains 252339 sequences.