Recursion, Catalan Numbers & Generating Functions · Superchallenge problem

A $2\times10$ board is to be tiled completely, without overlaps, using $1\times2$ dominoes (in either orientation) and L-shaped trominoes (three cells of a $2\times2$ square, in any of the four rotations). How many tilings are there?