

Let f(n) be the number of ways to tile a 2 by n rectangle with 2 by 1 dominoes. Note that f(0) = 1, f(1) = 1 and f(2) = 2. Write a recurrence relation for f(n) for general n.
PayPal Gateway not configured
PayPal Gateway not configured


Let f(n) be the number of ways to tile a 2 by n rectangle with 2 by 1 dominoes. Note that f(0) = 1, f(1) = 1 and f(2) = 2. Write a recurrence relation for f(n) for general n.
PayPal Gateway not configured
PayPal Gateway not configured