MathNet 2006 — Part 04 Question 113

For a positive integer $n$, find in how many different ways a $2 \times n$ rectangle can be partitioned into rectangles with integer side lengths.