hihi, all - i was a bit cryptic in my message - the problem was one from this list in december 2003, to find, for each n, the minimum area convex n-gon in the 2-d integer lattice so convex polygon in the plane, all of whose vertices have integer coordinates i announced earlier results up to n=128 in december 2006, but quit after n=256 results seemed strange i also found the minimum L1-perimeter convex lattice polygons up to n=512 (corroborating the n<=256 results with a completely different program) so i have a question for you all - when i write up the results, where do they go (aside from to oeis of couree)? more soon, cal Chris Landauer Aerospace Integration Science Center The Aerospace Corporation cal@aero.org