# HSF-IF.A.3

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 \ge 1$.

## Tasks

Snake on a Plane