UnsungQueasyMap created by acwoss - https://repl.it/@acwoss/UnsungQueasyMap

main.py

def perfect_numbers(N):
    def sieve_of_eratosthene(N):
        A = [True] * (N+1)
        A[0] = A[1] = False

        for value, prime in enumerate(A):
            if prime:
                yield value
                for i in range(value**2, N+1, value):
                    A[i] = False

    primes = sieve_of_eratosthene(500)
    
    while True:
        p = next(primes)
        perfect_number = 2**(p-1) * (2**p - 1)
        if perfect_number > N:
            break
        yield perfect_number

for i in perfect_numbers(500):
    print(i)