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
-
Swap the first and last columns
23167 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5819 Solvers
-
Back to basics 21 - Matrix replicating
1823 Solvers
-
620 Solvers
-
936 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!