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
-
12883 Solvers
-
Back to basics 8 - Matrix Diagonals
973 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1286 Solvers
-
866 Solvers
-
Find the index of n in magic(n)
277 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!