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 Solvers36
Suggested Problems
-
7467 Solvers
-
Number of 1s in a binary string
11010 Solvers
-
Return elements unique to either input
808 Solvers
-
Side of an equilateral triangle
6882 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
600 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!