Static int s 3. Printfn d d a s. In a recursive formula each term is defined as a function of its preceding terms.
65 50 35 20.
The smallest of all sub-problems is called the base case. Let a 1 10 and a n 2a n-1 1. So the series becomes. The base case returns a value without.