Pascal Triangle Generator in Python

pascal.py

def pascal(n):
    if n == 1:
        return [ 1 ]
    if n == 2:
        return [ 1, 1 ]
    prev = pascal(n-1)
    results = []
    for i in range(n):
        if i == 0:
          continue
        if i == n-1:
            break
        results.append(prev[i] + prev[i-1])

    return [1] + results + [1]

# functional style, no loops
def pascal_fp(n):
    if n == 1:
        return [ 1 ]
    prev = pascal_fp(n-1)
    return list(map(lambda x,y:x+y, [0] + prev, prev + [0]))