Prime number generator using lazy Sieve of Eratosthenes

prime_generator.py

def natural_number_generator(n):
    yield n
    yield from natural_number_generator(n+1)

def sieve_of_eratosthenes(number_list):
    next_prime = next(number_list)
    yield next_prime
    yield from sieve_of_eratosthenes(i for i in number_list if i%next_prime != 0)

if __name__ == '__main__':
    # Number of primes to generate
    range_limit = 100   
    # Sieve prime numbers
    prime_generator = sieve_of_eratosthenes(natural_number_generator(2))

    for i in range(range_limit):
        print(next(prime_generator))