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
-
3902 Solvers
-
Maximum running product for a string of numbers
2258 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1406 Solvers
-
Let's get back to school, and create multiplication tables
245 Solvers
-
497 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!