fibo.py

import functools

def memoization(f):
    cache = {}
    def func_wrapper(n):
        if n not in cache:
            result = f(n)
            cache[n] = result
        return cache[n]
    return func_wrapper

#@functools.lru_cache(maxsize=None)
@memoization
def fibo(n):
    if n < 2:
        return 1
    return fibo(n - 1) + fibo(n - 2)

for i in range(100):
    print("fibo(%d) = %d" % (i, fibo(i)))