If you're seeing this message, it means we're having trouble loading external resources on our website.

If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

Main content

Evaluate sequences in recursive form

You might need: Calculator

Problem

{g(1)=5g(n)=1g(n1)4\begin{cases} g(1)=5 \\\\ g(n)=-1 \cdot g(n-1) -4 \end{cases}
g, left parenthesis, 2, right parenthesis, equals
  • Your answer should be
  • an integer, like 6
  • a simplified proper fraction, like 3, slash, 5
  • a simplified improper fraction, like 7, slash, 4
  • a mixed number, like 1, space, 3, slash, 4
  • an exact decimal, like 0, point, 75
  • a multiple of pi, like 12, space, start text, p, i, end text or 2, slash, 3, space, start text, p, i, end text
Stuck?
Stuck?