Primes_generator.py

def primes():
	"""
	Generate an infinite series of primes based on the 
	Sieve of Eratosthenes
	"""
	D = {}
	q = 2
	while True:
		if q not in D:
			yield q
			D[q*q] = [q]  # Thank you Eratosthenes
		else:
			for p in D[q]:
				# Back-fill the dictionary
				# With keys being composites and the
				# list value being its components
				D.setdefault(p + q, []).append(p)
			del D[q]
		q += 1

primes_gen = primes()  # instantiate the generator
print [next(primes_gen) for x in range(0,10)]  # use it!