Neo-Fibonacci (Dynamic Programming solution)

#returns the nth Neo-Fibonacci number
def neo_fib(n):
    cache = [1, 1, 1]
    for i in range(3, n):
        cache.append(cache[-1] + cache[-2] + cache[-3])
    return cache[n-1]