Question

Say you are tiling a 2 × n rectangle with L-shaped tiles of area 3 (trominoes).
To tile the rectangle is to cover it with tiles so that no tiles overlap, no tiles are hanging off the
edge of the rectangle, and every space on the rectangle is covered by some tile. Let T(n) denote
the number of ways to tile the rectangle. Write a recurrence for T(n).

Answer 1

@dan815 @Directrix @freckles

Answer 2

@nincompoop

Answer 3

can u draw a picture

Answer 4

hello?