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
-
Remove any row in which a NaN appears
8774 Solvers
-
Create a cell array out of a struct
2435 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2541 Solvers
-
18183 Solvers
-
523 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!