def fibonacci2(number: int) -> int:
    """
    Generate the fibonacci number for n
    Utilizes caching to mimic literal memoization, has lower recursive limit...

    0, 1, 1, 2, 3, 5, 8, 13, .... 0 = 0 , 1 = 1, 3 = 2, etc
    :param number: iteration of the Fibonacci sequence
    :return: Fibonacci number
    """
    if number < 2:
        return number
    return fibonacci2(number - 1) + fibonacci2(number - 2)