Project Euler 002

By starting with the first three terms of the Fibonacci sequence as 1,
1, and 2, each third term will be even. This saves us the trouble of
testing for evenness and lets us write a more computationally efficient
program. Then it's just a matter of summing them up and making sure we
stop summing when the third term goes above 4 million.