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
-
Return a list sorted by number of occurrences
2888 Solvers
-
821 Solvers
-
Getting the indices from a matrix
718 Solvers
-
Convert given decimal number to binary number.
2271 Solvers
-
3204 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!