If we split any integer number to a sum of positive integers and we look at the sums where the difference between the two highest different numbers is 1, find the function that returns how many sums like that are they for any integer.
For example, Look at the number 5. 5 written as the following sums:
1 + 1 + 1 + 1 + 1
2 + 1 + 1 + 1
2 + 2 + 1
3 + 2
4 + 1
In the bold sums, the difference between the two highest different numbers is 1, and the function I'm looking for will return 3.
Can you help me find this function?
Thanks for your help.