[seqfan] Re: Two tenuously related problems concerning squares

[Giovanni Resta]

On 06/16/2013 06:04 PM, Alonso Del Arte wrote:

> 2. At the time Howard Eves wrote *Mathematical Reminiscences*, a division
> of a 175 x 175 square into 24 smaller squares, none of them equal, was the
> record. The interest so far appears to be in using as few smaller squares
> as possible. But what I'm curious about is: what is the minimum possible
> number of equal squares?

A036444 = "Integer sided squares, no more than a(n) of any size, can 
tile the square with side n." is what you are looking for.

Here a(175)=1.  It is well known that the smallest n such that a(n)=1 is 
112. The Eric Friedman link has pictures.

Giovanni