n = (limit - 2)/2
sievesz = (n + me._NBIT - 1)/me._NBIT
me._sievemax = sievesz*me._NBIT
- me._bits = n*[0]
+ me._bits = sievesz*[0]
## This is standard Sieve of Eratosthenes. For each index i: if
## bit i is clear, then p = 2 i + 3 is prime, so set the bits