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
-
9153 Solvers
-
Convert a numerical matrix into a cell array of strings
2417 Solvers
-
Determine Whether an array is empty
811 Solvers
-
398 Solvers
-
2626 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!