Adam Ponting found a way to cover arbitrarily large (e.g. as measured by inradius) contiguous patches of the plane by distinct squares of sizes from $$1$$ to $$(2n+1)^2$$, for any $$n$$. Via demonstrations.wolfram.com/Pon and mathpuzzle.com/