Let $p_\text{odd}(n)$ denote the number of partitions of $n$ into an odd number of parts, and let $p_\text{even}(n)$ denote the number of partitions of $n$ into an even number of parts. How do I prove that
$|p_\text{even}(n) - p_\text{odd}(n)|$ is equal to the partitions of $n$ into distinct odd parts.
Show that the number of partitions of $n$ for which no part appears exactly once is equal to the number of partitions of n for which every part is divisible by 2 or 3.
Show that the number of partitions of $n$ for which no part appears more than twice is equal to the number of partitions of $n$ for which no part is divisible by 3.
Continuing with what Brian Scott started, we have for number three, that this is the generating function for partitions in which no part appears more than twice:$$\prod_{k\ge 1} (1+z^k+z^{2k}).$$ And the generating function for partitions in which no part is divisible by three is $$\prod_{k\ge 0} \frac{1}{1-z^{3k+1}} \prod_{k\ge 0} \frac{1}{1-z^{3k+2}}.$$ Note that the second generating function can be written as $$\prod_{k\ge 1} \frac{1-z^{3k}}{1-z^k}$$ because the numerators cancel all denominators where a power of $z$ appears whose exponent is divisible by three. But we have $$\frac{1-z^{3k}}{1-z^k} = 1 + z^k + z^{2k},$$ proving the claim.
This is sequence A000726 from the OEIS.