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 Solvers39
Suggested Problems
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2541 Solvers
-
Back to basics 12 - Input Arguments
622 Solvers
-
632 Solvers
-
Is this triangle right-angled?
6425 Solvers
-
792 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!