I saw this in the NAdigest mailing list, and it was obviously suggested by $70^2 =\sum_{j=1}^{24} j^2 $:
From: Gerhard Opfer [email protected]
Date: November 06, 2017
Subject: Mathematics, combinatorial
Is it known, whether a square Q of size 70 x 70 can be covered by little squares q_j of size j x j, j=1,2,...,24.
Can one say something about this problem in general.
I don't know.
My first thought was to look at the unit square. However, I realized that it was possible to surround the unit square with larger squares.
The fact that it is possible to square the square (i.e., fill an integer-sided square with distinct integer-sided squares - see https://en.wikipedia.org/wiki/Squaring_the_square) means that some property of 70 and 1 through 24 is needed if it is not possible.
It just might be impossible to square a 70 x 70 square.
Your turn.
According to the wikipedia link you've posted, the smallest (in terms of side length) perfect squared squares are $110\times110$, so it appears no such realization is possible.
This result is due to Ian Gambini in his doctoral thesis, and can be found here (there is no paywall!). It appears to have been determined via computer-aided search.