F.IF.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 _ 1.

1. Natural Numbers - sum of 1st 16 Fibonacci numbers
2. Natural Numbers - sum of 1st 13 Fibonacci numbers