Exactly the same Partition function as Problem 76, please read there for a more in-depth explanation.
I set my goal = 1000 and alist = first 1000 primes (These are arbitrary) and then I loop through ways
Partition and Prime generation function are in my Essential Functions
Enter a number (yourinput)
Code will output the first number that can be written as the sum of atleast 2 primes in more than yourinput ways