Question: number of partitions

Hello

I would like to write a process f(p,n) that returns the number of partions of a positive integer n into p parts. possible parts are only 0,1,4,6,8,9. these parts cn be used several times. the order is not important.

example

f(3,8)=3 because (0,0,8), (0,4,4), (1,1,6).

thanks for your help!

Please Wait...