Partition of an Integer + Number of partitions

Question

A partition of an integer n is a way of writing n as a sum of positive integers. For

example, for n=7, a partition is 1+1+5. I need a program that finds all the

Answer 1

A sort of "hack" would be to make r an argument of part, pass it along recursively an just print the output if level equals r.