Recursion & Recurrence Relations

How do you describe a sequence that goes on forever without writing down every term? You define it in terms of itself. "Each number is the sum of the two before it" captures the entire Fibonacci sequence in one short rule. This is recursion: a base case to start from and a recurrence rule that builds the next value out of earlier ones. From two lines, infinity unfolds.