euler2.py

#! /usr/bin/env python3
from functools import lru_cache
from itertools import count, takewhile

numbers = count(1)

MAX = 4000000

@lru_cache(maxsize=None)
def fib(n) :
    if n < 3 :
        return 1
    else :
        return fib(n-2) + fib(n-1)


fibs = (fib(x) for x in numbers)
even_fibs = (x for x in fibs if x % 2 == 0)

even_fibs_under_max = takewhile(lambda x : x < MAX, even_fibs)

print(sum(x for x in even_fibs_under_max))

lru_cache is really useful.
your thinking is very organized you took it as small steps and finished them separately and depending on each other
i like it.

You can use itertools.count or xrange instead of implementing numbers

@blazeeboy Thanks :). And thanks for your idea, I've learned a lot from the other solutions so far .

@mtayseer range must have upper limit and I wanted to make a generic solution, you're right itertools.count is what I should use but I forgot about it , Thanks for reminding me :)

@mtayseer In fact even_fibs_under_max can be simpler using itertools.takewhile, I noticed that while solving the same problem using Opa :)