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 Solvers36
Suggested Problems
-
Find the peak 3n+1 sequence value
2565 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2535 Solvers
-
90 Solvers
-
1058 Solvers
-
Find the Oldest Person in a Room
20238 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!