How do I write a a recursive function that counts the number of sequences that sum up to that number (user input)?
Also, just for giggle, I calculated that this function : [B]1/2n^2-1/2n+1[/B] gives the number of sequence that sums to a number n. Try it out and see if its correct. I give no guarantees. Read More
Edited by firstPerson: n/a