Possible solution (using the wrong data structure for this approach) for Project Euler, Problem 23

problem23.py

s = 0
abundant_numbers = []

def get_divisors(number):
        return [x for x in xrange(1, number/2 +1) if number % x == 0]

for i in xrange(1,  28124):
        if sum(get_divisors(i)) > i: 
                abundant_numbers.append(i)
        if not any((i-a in abundant_numbers) for a in abundant_numbers):
                s += i

print s