Prime multiples removing up to N and making list any fast method?

[chandra sekaran <sekar.bc@gmail.com>]

Is there any fast method to remove

prime multiples from 1 to say 2^256 and counting the elements?

 1,2,3,....2^256,

Removing multiples of 2 we get

1,3,5,7,9,11,13,15,17,19,21,23,25,27... 2^256-1

then  removing multiples of  3 we get

 1,3,5,7,11,13,17,19,23,25,27..... 2^256

then removing multiples of  5 we get

1,3,5,7,11,13,17,19,23,27,... 2^256

Like this 7,11,13 up to prime N.

Regards,

Chandrasekaran.B