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
-
47353 Solvers
-
Sum all integers from 1 to 2^n
17851 Solvers
-
Project Euler: Problem 5, Smallest multiple
1671 Solvers
-
Determine if input is a Narcissistic number
219 Solvers
-
11488 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!