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
-
Replace NaNs with the number that appears to its left in the row.
3070 Solvers
-
123 Solvers
-
581 Solvers
-
5944 Solvers
-
Find the max element of the array
2327 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!