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
-
Project Euler: Problem 10, Sum of Primes
2131 Solvers
-
Find the square of the sum of the digits of a number
161 Solvers
-
295 Solvers
-
Electrical Diode Current Calculation
1326 Solvers
-
1737 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!