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 Solvers37
Suggested Problems
-
511 Solvers
-
558 Solvers
-
Natural numbers in string form
1858 Solvers
-
273 Solvers
-
Find the max element of the array
2206 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!