There is a function that counts the number of partitions of with $n$ digits?
I am aware of the partition function studied by Ramanujan, but what I want is a subset of the partitions that are counted by that function.
What I want is a function $p_k(n) =$ # of different partitions in $k$ integers
Example:
5 can be partitioned as
5
4 + 1
3 + 2
2 + 2 + 1
3 + 1 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 + 1
So for me, $p_1(5) = 1, p_2(5) = 2, p_3(5) = 2, p_4(5) = 1, p_5(5) = 1$
In general the function must satisfy that $p_1(n) = 1$ and $p_n(n) = 1$
That function even exists? or there is a sage or a general algorithm to compute that ?