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
-
Sort a list of complex numbers based on far they are from the origin.
5798 Solvers
-
Which values occur exactly three times?
5239 Solvers
-
511 Solvers
-
Celsius to Fahrenheit converter
666 Solvers
-
construct matrix with identical rows
209 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!