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
-
Maximum running product for a string of numbers
2254 Solvers
-
Set the array elements whose value is 13 to 0
1439 Solvers
-
Matrix multiplication across rows
398 Solvers
-
927 Solvers
-
9387 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!