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
-
28489 Solvers
-
2258 Solvers
-
4520 Solvers
-
478 Solvers
-
Side of an equilateral triangle
7246 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!