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
-
Cell Counting: How Many Draws?
2520 Solvers
-
Basics: Divide integers to get integer outputs in all cases
137 Solvers
-
Find the position of first minimum value in an integer array with numbers
185 Solvers
-
Is this triangle right-angled?
6645 Solvers
-
1898 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!