1 2 3 4 5 6 7 8
def fib(n): sequence = [1,1] if n <= 2: return 1 for i in range(2, n): next_num = sequence[i-1] + sequence[i-2] sequence.append(next_num) return max(sequence)