Prime sieve using generators (Python version of SICP 3.5.2)

sieve.py

""" Infinite sieve of Eratosthenes using generators.

Python version of the Scheme code in SICP, paragraph 3.5.2.

"""

def primes(integers):
    first = next(integers)
    yield first
    yield from primes(i for i in integers if i % first != 0)

def integers(start):
    while True:
        yield start
        start += 1

def take(stream, howmany):
    return [next(stream) for _ in range(howmany)]

ps = primes(integers(2))
print(take(ps, 100))