Optimal Packings of 22 and 33 Unit Squares in a Square

Wolfram Bentz

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together wi…