prime.py

#!/usr/bin/python

def sieve(n):
    nums = [i+1 for i in range(2, n, 2)]
    ans = [2]
    while len(nums) != 0:
        for i in range(nums[0]*2, nums[-1]+1, nums[0]):
            if i in nums: nums.remove(i)
        ans.append(nums.pop(0))
    return ans

print sieve(10000)