Problem 48990. Solve the recursion

• Created by Alisio
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Sequences & Series II

• 15 Problems
• 89 Finishers

Sum of series

• 10 Problems
• 864 Finishers

Like (0)

Difficulty:

(880)

Rate

• Solve Later   
• Add To GroupÂ

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

f(1)=4;

f(2)=8;

Solve

Solution Stats

62.69% Correct | 37.31% Incorrect

• 67 Solutions
• 36 Solvers

Last Solution submitted on Dec 23, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers36

Suggested Problems

• Return the first and last characters of a character array

  10625 Solvers

• Pi Estimate 1

  1259 Solvers

• Right Triangle Side Lengths (Inspired by Project Euler Problem 39)

  1901 Solvers

• Square Diagonal

  277 Solvers

• Square root of a number

  428 Solvers

More from this Author14

• Mean Square Error

  51 Solvers

• Taxi vs Euclides

  27 Solvers

• Taxicab distance

  42 Solvers

• Rotate the Image

  14 Solvers

• Flip the Image

  16 Solvers