3

Part of 2017 Cono Sur Olympiad

Problems(1)

Tiling with Tetrominos

Source: Cono Sur Olympiad 2017, problem 3

n

be a positive integer. In how many ways can a

4 \times 4n

grid be tiled with the following tetromino? [asy] size(4cm); draw((1,0)--(3,0)--(3,1)--(0,1)--(0,0)--(1,0)--(1,2)--(2,2)--(2,0)); [/asy]

combinatoricscono sur