finding palindrome substrings with python

palindrome.py

def palindrome(input):
    length = len(input)
    palindromes = []
    for x in range(2,len(input)+1):
        min = 0
        while (min+x) < length+1:
            if(input[min:(min+x)] == input[min:(min+x)][::-1]):
                palindromes.append(testString)
            min = min+1
    return palindromes

print(palindrome("ninanin"))
print(palindrome("nnn"))