The Fibonacci sequence is a series of numbers where each number in the sequence is
the sum of the preceding two numbers, starting with 0 and 1. It is natural to
consider a recursive function to calculate a subset of the Fibonacci sequence, but
this may not be the most efficient mechanism.