Fix the Fibonacci sequence
Problem 21

This version uses a modified form of the tau function to find the
sum of the divisors. It is not particularly performant but it is
interesting.
Problem 21 - Improved performance

This version of the proper divisor sum is a much simpler brute-force
search-based calculation and ends up being more performant as it
avoids memory pressure.