How is this different from the coin change problem?

I am having difficulty in understanding how this problem is different from the coin change problem? in both the cases we are trying to find ways to split a given total sum into given denominations or factors.
Appreciate any help!


@BSM I believe the difference can be found from the question.
Coin change question talk about “how many different combination” but this number of factor problem talks about “how many possible combinations”.
For example,
1 - Coin change - 1,1,3 is same as 1,3,1 and only 1 will be counted
2 - number of factor - 1,1,3 is not same as 1,3,1 and both will be counted