I'm puzzled by the following; maybe someone here can wrangle the asymptotics? Forrest Gump fills n unit chocolate squares into the squarest possible rectangular box (ie the sides are A033676 and A033677). Sometimes this works well (when n is square) and sometimes not so well (when n is prime). How can he best approximate the perimeter-to-area ratio as n increases? It's a slowly decelerating decreasing function. The average for n up to 8000 is about 0.23728, to 10000 it's around 0.23004. Does it vanish or approach some non-zero limit or what? For more fun we might generalize to d>2 dimensions, seeking the average minimal hypersurface-to-hypervolume ratio. (For example in 3d cubes are nice, but primes remain a pain...) Be well and prosper!