An upper bound for integer partitions with unique summands

227 Views Asked by At

Let $p_\neq (n)$ be the number of all partitions of $n$ such that all summands are distinct (for example $p_\neq (6)=4$).

How do we show that $p_\neq (n) \leq e^{2\sqrt n}$?