Optimize prime calculation loop by skipping evens.

This gives almost a 2x speed-up for a sample size of 1e6.  Performance could probably be improved further, e.g. by not storing bits for even numbers at all (but special-casing the number 2).