Number of Partitions for the HP-41

This program is supplied without representation or warranty of any kind.
Jean-Marc Baillard and The Museum of HP Calculators therefore assume no
responsibility and shall have no liability, consequential or otherwise, of
any kind arising from the use of this program material or any part thereof.

Overview

-The number of unrestricted partitions p(n) is the number of decompositions
of n into integer summands without regard to order.
-The number of partitions into distinct parts q(n) is the number of
decompositions of n into distinct integer summands without regard to order.
-The following programs use 2 methods to compute p(n) and q(n):