Найти все возможные наборы натуральных чисел, с суммой равной данному

splitR(N):=splitR0(N,1)
splitR0(N,m):= for i = m .. N
 [[i] ++ splitR0(N-i,i)]

_split = lambda Rmin, R: sum([ [ [i]+l for l in _split(i, R-i)] for i in range(Rmin, R+1) ], []) if Rmin<R else [[R]]
splitR = lambda R: sorted(set( tuple(sorted(filter(None, l))) for l in _split(1, R) ))

def splitR0(t,N):
    if N==0:
        yield []
    else:
        for i in xrange(t,N):
            for lst in splitR0(i,N-(i+1)):
                yield [i+1] + lst
    
def splitR(N):
    lst = []
    for i in splitR0(0,N):
        lst += [i]
    return lst

splitR n = n `splitStartingWith` 1
n `splitStartingWith` i | n < i = []
                        | n < 2*i = [[n]]
                        | otherwise = [k:ks | k <- [i..n `div` 2], ks <- (n-k) `splitStartingWith` k] ++ [[n]]

def f(l):
    a=[[l]]
    for rl in xrange(1,l):
	for i in f(l-rl):
	    if i[0]<=rl:
		a.append([rl]+i)
    return a

def main(R):
    def q(t,m,prt):
        if(t<=0):
            return [prt]
        if(m>t):
            m=t
        o=[]
        while(m>0):
            o+=q(t-m,m,[m]+prt)
            m-=1
        return o
    return q(R,R,[])

def splitR0(t, N):
    for i in xrange(t, N/2+1):
        lst_i = [i]
        for lst in splitR0(i, N-i):
            yield lst_i+lst
    yield[N]
    
def splitR(N):
    if N<=0:
        return []
    return list(splitR0(1, N))

def splitR0(t, N, head):
    for i in xrange(t, N/2+1):
        for lst in splitR0(i, N-i, head+[i]):
            yield lst
    yield head+[N]
    
def splitR(N):
    if N<=0:
        return []
    return list(splitR0(1, N, []))