standard_description: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ³ 1.
problem_activity: Task
Using the graphs below, sketch a graph of the function $s(x) = f(x) + g(x)$.
[IMG]


aligns: no