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
-
6716 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1322 Solvers
-
305 Solvers
-
18071 Solvers
-
Check that number is whole number
5395 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!