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
-
16210 Solvers
-
The Goldbach Conjecture, Part 2
2417 Solvers
-
Cell Counting: How Many Draws?
2496 Solvers
-
800 Solvers
-
369 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!