Euler #95

def sumdivisors(n):
    divisors = []
    for x in range(1, int(n**0.5) + 2):
        if n % x == 0:
            divisors.extend((x, int(n/x)))
    divisors.remove(divisors[1])
    runningtotal = 0
    for y in divisors:
        runningtotal += y
    return runningtotal

bestlist = []
for a in range(1, 10**6 + 1):
    print(a)
    current = []
    while True:
        if (a in current) or (a > 10**6):
            try:
                current = current[current.index(a):]
            except ValueError:
                break
            if len(current) > len(bestlist):
                bestlist = current
                break
            break
        current.append(a)
        a = sumdivisors(a)
print(sorted(bestlist)[0])