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
-
322 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1324 Solvers
-
Convert from Base 10 to base 5
282 Solvers
-
Delete 2nd and 5th column of Given 6*6 matrix
172 Solvers
-
3470 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!