Show that the number of partitions of a positive integer n where no summand appears more than

Question:

Show that the number of partitions of a positive integer n where no summand appears more than twice equals the number of partitions of n where no summand is divisible by 3.
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: