SOLUTION: A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 2n Find f(4)

SOLUTION: A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 2n Find f(4)

Algebra.Com

Question 1028102: A sequence is defined recursively by f(1) = 16 and f(n) = f(n-1) + 2n
Find f(4)
Answer by robertb(5830) (Show Source): You can put this solution on YOUR website!
f(2) = f(1) + 4
f(3) = f(2) + 6
f(4) = f(3) + 8
Adding corresponding sides of the three equations above, we get
f(4) = f(1) + 18
==> f(4) = 16 + 18 = 34
RELATED QUESTIONS
A sequence is defined recursively by f(1)=20 and fn=f(n-1)-4n find... (answered by ikleyn)

If a sequence is defined recursively by f(1)= -2 and f(n-1) = 3(n-1)-4, then find the... (answered by ikleyn)

If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n>or=0 then f(2)... (answered by greenestamps)

A function is defined by f(0)=0 and f(n)=f(n-1)+2n, for n > 0. Find... (answered by ikleyn)

2. If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0 then (answered by MathLover1)

Let {F(n)} = {1,1,2,3,5,8,13,21,34,55,��} be the Fibonacci sequence defined by F(1) = (answered by AnlytcPhil)

A sequence has its first term equal to 4, and each term of the sequence is obtained by... (answered by ikleyn)

A function f is defined on the set of positive integers by f(1) = 1, f(3) = 3, f(2n) = n, (answered by greenestamps)

The Fibonacci sequence, is defined by F_0 = 0, F_1 = 1, and F_n = F_{n - 2} + F_{n - 1}. (answered by CPhill,greenestamps)