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
-
17481 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
788 Solvers
-
Fahrenheit to Celsius converter
612 Solvers
-
565 Solvers
-
517 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!