Coming back to this to look at some patterns and make a couple more notes.
First off: for odd n, there's never going to be a solution that uses ONLY L or ONLY I shapes. Which makes sense: for a 2x2n rectangle for odd n, you'd need to arrange n-1 I's or L's into most of the space (and the only way we know how to do that is 2x4 blocks) and then fit one extra one into...a 2x2 space. Oops! So for odd n, those specimens just will never exist.
Once we hit n = 4, we're in full swing: there's finally specimens for all seven combinations of pieces, and ten total unique solutions controlling for symmetry.
I have to stop and pay attention to work for a bit, but one of the things I'm excited to fiddle with more is looking at where genuinely new non-decomposable patterns show up (like the sixth one down on the left in this image) where it's not just a concatenation of previously attested smaller specimens.
Does this mean we don't ever have to care about the mirroring of L pieces, tho? Nope! We just had to yet. That changes immediately with...
n = 3
For which we have four solutions, controlling for symmetry (several more that I've ignored if you don't, my set will keep diverging more and more from Mark's because of this). The bottom-most of which is a case where we have BOTH versions of L/J in play -- there are times when that WILL matter!
There's also no single-piece solutions except 3 O's.
The first couple of values of n are very trivial:
n = 1 (so 2x2n = 2x2) the only solution is a single O.
n = 2 (so 2x4) has four solutions: a pair of O's, a pair of I's, and two different orientations of a pair of L's.
But me being me, I want to avoid repetitions across mirror/rotational symmetry, so I'm going to decide that second pair-of-L's isn't interestingly different from the first one. I'm only going to count that once. So really we have three n=2 solutions, controlling for symmetry.