It is known that squares with side 1-24 can't quite pack in a side 70 square. However, use four copies of each and a side 140 square is possible, as shown by Erich Friedman.
I just noticed that squares 1-24, each twice, might fit into a side 99 square with one empty space. Is that possible?
Here are a few similar problems, usually with 1 empty space. I'd also be interested in solutions for $(n+1)(n-1)$ rectangles.
- Squares 1-6 × 8 in a side 27 square - 1.
- Squares 1-7 × 6 in a side 29 square - 1.
- Squares 1-8 × 5 in a side 32 square - 4. -- Solvable
- Squares 1-8 × 6 in a side 35 square - 1.
- Squares 1-10 × 3 in a side 34 square - 1.
- Squares 1-11 × 4 in a side 45 square - 1.
- Squares 1-12 × 4 in a side 51 square - 1.
- Squares 1-15 × 3 in a side 61 square - 1.
- Squares 1-13 × 5 in a side 64 square - 1.
- Squares 1-16 × 3 in a side 67 square - 1.
- Squares 1-23 × 2 in a side 93 square - 1.
- Squares 1-24 × 2 in a side 99 square - 1. -- opening problem
- Squares 1-47 × 1 in a side 189 square - 1.
- Squares 1-48 × 1 in a side 195 square - 1.
- Squares 1-57 × 3 in a side 436 square - 1.
- Squares 1-57 × 7 in a side 666 square - 1.
Do any of these have solutions?
Closely related: Balanced Consecutive Tilings.
Vaguely related -- I've updated solutions for Mrs. Perkins's Quilt up to size 40000.