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
-
Find the longest sequence of 1's in a binary sequence.
6873 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
Calculate the derivative of a polynomial
241 Solvers
-
717 Solvers
-
Calculate Amount of Cake Frosting
30920 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!