Is there a standard recurrence relation to solve this? I have infinite supply of $m\times 1$ and $1\times m$ bricks.I have to find number of ways I can arrange these bricks to construct a wall of dimensions $m\times n$.
My problem is how can I approach the question? Is there a recurrence relation to describe the problem ? 

Hint.  A recurrence relation would be a good idea.


*

*Place an $m\times1$ brick along the side of length $m$.  What do you now have to do to complete the construction of the wall?

*Are there any other ways that you could have started?
Good luck!
