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
-
1635 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
786 Solvers
-
Check if number exists in vector
14592 Solvers
-
660 Solvers
-
Convert a Cell Array into an Array
2348 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!