'''
project eurler.net problem 2
Each new term in the Fibonacci sequence is generated by adding the previous two terms. 
By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...

By considering the terms in the Fibonacci sequence whose values do not exceed four million, 
find the sum of the even-valued terms.
'''
# my attempt as of 9/30/15 which only recursively calculates the Fibonacci number


def rfib(n):
    if n <= 2:
        return 1
    return rfib(n-1) + rfib(n-2)

