エラトステネスの篩で素数を無限に列挙する

eratosthenes.py

from itertools import count

def prime():
  def sieve(ints):
    i = next(ints)
    yield i
    for n in sieve(k for k in ints if k % i != 0):
      yield n
  return sieve(count(2))