Euler 2

def fib():
    x, y = 1, 2
    while x < 4000000:
        yield not(x & 1) and x or 0
        x, y = y, x + y

print sum([x for x in fib()])