Finding prime numbers with the Sieve of Eratosthenes (Originally: Is there a better way to prepare this array?)

Question

Note: Version 2, below, uses the Sieve of Eratosthenes. There are several answers that helped with what I originally asked. I have chosen the Sieve of Era

Answer 1

The easiest solution would be to return some member of the Collections Framework instead of an array.