Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recurrence Relationshard
0:00.0

A 1×n1 \times n1×n board is tiled with 1×11 \times 11×1 squares and 1×21 \times 21×2 dominoes. Let ana_nan​ denote the number of distinct tilings. Which recurrence and initial conditions are correct?