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 Solvers39
Suggested Problems
-
Project Euler: Problem 3, Largest prime factor
1810 Solvers
-
1913 Solvers
-
Generate a random matrix A of (1,-1)
430 Solvers
-
766 Solvers
-
580 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!