### 3.7.178. Packing almost squares

Denotes that a constraint can be used for solving the packing almost squares problem: tile a rectangle for which sides are consecutive integers by rectangles of size $1×2,2×3,\cdots ,n×\left(n+1\right)$ which can be rotated by 90 degrees. The problem is described in http://www.stetson.edu/~efriedma/almost/. Since there does not always exist a tiling, one can also consider a variant where the goal is to find the rectangle with minimal area. Figure 3.7.48 provides a solution for $n=26$ found by H. Simonis.