Problem
Mathematicians talk about the Fibonacci Sequence, which is a series of numbers defined recursively. The first Fibonacci number is 0, and the second is 1. From there on out, the nth Fibonacci number is Fib(n) = Fib(n - 2) + Fib(n - 1). Write a function to input an integer index and then calculate that index value in the Fibonacci sequence.