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
-
Find the peak 3n+1 sequence value
2572 Solvers
-
Permute diagonal and antidiagonal
518 Solvers
-
456 Solvers
-
1746 Solvers
-
Electrical Diode Current Calculation
1326 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!