Writing a fibonacci function

Here you go

def fib(maximum):
    if maximum<2:
        return []
    current=[1,1]
    while True:
        candidate=sum(current[-2:])
        if candidate>=maximum:
            break
        current.append(candidate)
    return current