I use the CAS MathCad to eapand.
Here is WolframAlpha .
In a card game an Ace = 4 points, king=3 points, queen=2 points and jack=1 point.
Now we have only 16 cards that have points to deal with(4A,4K,4Q,4J)
To reach 4 points, we have 5 ways: (0A+0K+0Q+4J),(0A+0K+1Q+2J),(0A+0K+2Q+0J),(0A+1K+0 Q+1J),(1A+0K+0Q+0J)
Or another example to reach 7 points we have 9 ways: (0A+0K+2Q+3J),(0A+0K+3Q+1J),(0A+1K+0Q+4J),(0A+1K+1 Q+2J),(0A+1K+2Q+0J),(0A+2K+0Q+1J),(1A+0K+0Q+3J),(1 A+0K+1Q+1J),(1A+1K+0Q+0J)
How can I get a formula to find the number of ways to reach a specific point "n".