def solve():
n = 1
max = 500
while(True):
t = triangle(n)
num_divisors = len(list(div_gen(t)))
if num_divisors > max:
break
n = n + 1
return t
def isAbundant(n):
if sum(list(div_gen(n))[:-1]) > n:
return True
return False
def d(n):
return sum(list(div_gen(n))[:-1]) #slice to not include number itself