Problem 48990. Solve the recursion
Solve the recursion: f(n)=f(n-1)+1 + f(n-2)+2.
f(1)=4;
f(2)=8;
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers36
Suggested Problems
-
5781 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2514 Solvers
-
607 Solvers
-
730 Solvers
-
998 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!