Seive_Prime in python

seive_prime.py

#!/usr/bin/python

# inserting 1 for every prime and 0 of non prime within a given range

def prime_list(n):
    pr = [-1] * n
    ind = 2
    pr[0] = pr[1] = 0
    pr[2] = 1

    while ind <= n:
        for i in range(ind, n, ind):
            if i == ind:
                pr[i] = 1
            else:
                pr[i] = 0
        ind +=1
        try:
            while pr[ind] != -1 and ind < n:
                ind += 1
        except:
            pass
    print pr