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
-
2559 Solvers
-
Back to basics 8 - Matrix Diagonals
970 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
871 Solvers
-
Element by element multiplication of two vectors
399 Solvers
-
1062 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!