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 Solvers36
Suggested Problems
-
1816 Solvers
-
Convert a numerical matrix into a cell array of strings
2383 Solvers
-
714 Solvers
-
1046 Solvers
-
Calculate Amount of Cake Frosting
28987 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!