Write a recursive program to compute the number of ways in which an integer k * can be written as sum, each of whose operands is greater than one but less * than k.
Example:
javac MyRecursiveClass.java
java MyRecursiveClass 10
Integer 10 can be written as 11 sums.
Integer 10 written as sums:
1 : 2 + 8
2 : 2 + 2 + 6
3 : 2 + 2 + 2 + 4
4 : 2 + 2 + 2 + 2 + 2
5 : 2 + 2 + 3 + 3
6 : 2 + 3 + 5
7 : 2 + 4 + 4
8 : 3 + 7
9 : 3 + 3 + 4
10 : 4 + 6
11 : 5 + 5