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
-
Find the numeric mean of the prime numbers in a matrix.
9163 Solvers
-
611 Solvers
-
757 Solvers
-
Basics: Divide integers to get integer outputs in all cases
137 Solvers
-
Check that number is whole number
5438 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!