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 Solvers38
Suggested Problems
-
5972 Solvers
-
Who is the smartest MATLAB programmer?
791 Solvers
-
07 - Common functions and indexing 3
427 Solvers
-
6112 Solvers
-
621 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!