Let's say I want to fill an $n \times n$ board with tiles that have the shape of a $3 \times 3$ square with the $4$ corners cut out (the tile makes a plus sign) such that the sides of each tile are parallel to the board. What makes this problem different from other tiling problems is that these tiles can be overlapped. Furthermore, it is fine if some parts of the outmost tiles are sticking out of the edges of the $nxn$ board because then, we can just cut out whatever parts are extra.
The question is to prove that the upper bound for the number of tiles needed to tile the board in such a manner is $\frac{(n+2)^2}{5}.$
I don't quite see how to prove such a thing. For example, I don't think that this bound is tight. When I tried smaller values of $n$, I got $1$ for $n=1$, $2$ for $n=2$, $3$ for $n=3$, $4$ for $n=4$, $7$ for $n=5$, $11$ for $n=6$, etc.
I haven't actually gotten a scenario where I met this upper bound. Does anyone have any ideas?