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 3, Largest prime factor
1821 Solvers
-
Matrix indexing with two vectors of indices
782 Solvers
-
Check if number exists in vector
14486 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
602 Solvers
-
1736 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!