#! /usr/bin/python
from tools import divisor_sum
result = []
for i in xrange(0,10001):
divA = divisor_sum(i)
divB = divisor_sum(divA)
if divB == i and divA != divB:
result.append(i)
print sum(result)
#! /usr/bin/python
from tools import divisor_sum
# 4179871
abn = []
for n in xrange(1, 20162):
d = divisor_sum(n)
if d > n:
abn.append(n)
#print sum(abn)
l = []
for a in abn:
if a / 2 not in abn:
l.append(a)
print l
print sum(l)
#! /usr/bin/python from tools import divisor_sum # 4179871 abn = [] for n in xrange(1,20162): d = divisor_sum(n) if d > n: abn.append(n) #print sum(abn) l = [] for a in abn: if a/2 not in abn: l.append(a) print l print sum(l)
