partitiontable.m

Given a nonnegative integer n, compute a table of the unrestricted partition function p(m) for m<=n.

Given a nonnegative integer n, compute a table of the unrestricted partition function p(m) for m<=n. This program uses a recurrence involving pentagonal numbers, which makes it necessary to compute p(m) for all m<=n in order to compute p(n). Thus, we get the table for free with this computation.