Comment by tuvix

I think the only truly trivial ones are for n = k^2. Even the solutions that have integer side lengths but aren’t completely packed by unit squares seem difficult to prove that they are the optimal s(n). I don’t know much at all about the problem though, just seems like if there’s any space at all you might be able to rotate or whatever to squeeze out some space.