Show that the number of partitions of the integer $n$ into three parts equals the number of partitions of $2n$ into three parts of size $< n$.
I can only prove it by building a bijection between the two sets. Could anyone prove it by generating functions or even by Ferrers diagram?