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
-
Sort a list of complex numbers based on far they are from the origin.
5816 Solvers
-
400 Solvers
-
303 Solvers
-
Combined Ages 1 - Symmetric, n = 3
333 Solvers
-
Converts numbers into characters
2152 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!