
Let's have an odd prime, $P$ of the form $P^2\equiv 1 (mod3)$. If we have a 7 X 7 square grid with 49 individual squares, we can fill it with trominoes. See below, where A1 is the position of the single empty square.
If we keep doubling the side of this square indefinitely, eg. $7^2, 14^2, 28...