The spt function (smallest parts function) is a function in number theory that counts the sum of the number of smallest parts in each partition of a positive integer. It is related to the partition function.
The first few values of spt(n) are:
For example, there are five partitions of 4 (with smallest parts underlined):
- 3 + 1
- 2 + 2
- 2 + 1 + 1
- 1 + 1 + 1 + 1
These partitions have 1, 1, 2, 2, and 4 smallest parts, respectively. So spt(4) = 1 + 1 + 2 + 2 + 4 = 10.
Like the partition function, spt(n) has a generating function. It is given by
While a closed formula is not known for spt(n), there are Ramanajuan-like congruences including
- George Andrews. "The number of smallest parts in the partitions of n".
|This number theory-related article is a stub. You can help Wikipedia by expanding it.|