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 Solvers39
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5804 Solvers
-
Return unique values without sorting
1007 Solvers
-
Convert a vector into a number
616 Solvers
-
Duplicate each element of a vector.
636 Solvers
-
631 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!