We consider tilings of a rectangle of size n × k with square tiles of size 1 × 1 and 2 × 2. We present a method to calculate the number of such tilings via matrix multiplication, where we optimize the number of multiplications needed and reduce the space required for the matrix multiplication by dynamically generating the matrices involved.