Solve the recursion: f(n)=f(n-1)+1 + f(n-2)+2.
f(1)=4;
f(2)=8;
Solve

Solution Stats

71 Solutions

38 Solvers

Last Solution submitted on Mar 23, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers38

Riccardo G. Armando Longobardi Ayush Lorenzo

Suggested Problems

More from this Author14

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!