def is_not_lychrel(n):
""" Returns whether or not n is Lychrel number (described) above, within 50 iterations. """
n = str(n)
for _ in range(49):
test = int(n) + int(''.join(reversed(n)))
if is_palindome(test):
return False
n = str(test)
return True
def problem_36():
double_palindrome = lambda n: is_palindome(n) and is_palindome(binary(n))
print(sum(filter(double_palindrome, range(10**6))))
