Partition

The partition function $p \colon \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ is defined so that $p(n)$ denotes the number of ways of writing $n$ as a sum of positive integers (without regarding order as important).

Properties

Generating function for partition function
Closed form for partition function with sinh
Pure recurrence relation for partition function
Recurrence relation for partition function with sum of divisors
Sum of divisors functions written in terms of partition function
Asymptotic formula for partition function

References

• 1964: Milton Abramowitz and Irene A. Stegun: Handbook of mathematical functions ... (previous) ... (next): $24.2.1 \mathrm{I}.A.$