三行：

    from functools import reduce
    accumulate = lambda n: 1 if n==0 else reduce(lambda x,y: x*y, range(1,n+1))
    return ([accumulate(m)/accumulate(n)/accumulate(m-n) for n in range(m+1)] for m in range(10))

两行：

	from itertools import combinations
	return ([len(list(combinations(range(n), m))) for m in range(n+1)] for n in range(10))