Solve the recursion: f(n)=f(n-1)+1 + f(n-2)+2.
f(1)=4;
f(2)=8;
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers40
Suggested Problems
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2588 Solvers
-
Calculate distance travelled when given radius and rotations
243 Solvers
-
5998 Solvers
-
866 Solvers
-
calculate the length of matrix
2645 Solvers
More from this Author14
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!