This is simple python script to display all possible permutation from sequence of number with repeated element

repeated_permutation.py

'''
Problems: Given list of sequence number from 1 to n. Generate lists of all possible permutation with 
repeated element. For example :

[1,2]         => [1,1], [1,2], [2,1], [2,2]
[1,2,3]       => [1,1,1], [1,1,2], [1,1,3], [1,2,1], [1,2,2], [1,3,3], [1,3,1], [1,3,2], [1,3,3],
                 [2,1,1], [2,1,2], [2,1,3], [2,2,1], [2,2,2], [2,3,3], [2,3,1], [2,3,2], [2,3,3],
                 [3,1,1], [3,1,2], [3,1,3], [3,2,1], [3,2,2], [3,3,3], [3,3,1], [3,3,2], [3,3,3], 
'''

def repeated_permutation(number, counter = 1, lst = []):
    if counter <= number:
        for i in range(1,number+1):
            lst.append(i)
            repeated_permutation(number, counter+1, lst)
            lst.pop()
    else:
        print lst	
	

# Example	
# repeated_permutation(4)