Q: Can I sieve myself?

A: Yes, for k*2^n-1 and k*2^n+1, fixed k, the fastest sieving program to use is

srsieve.

Use sr1sieve to sieve a single k, or sr2sieve to sieve multiple k's at once.

However, for k<10000 (=10^4), on both plus and minus side, Psieve already sieved deep enough all n<3M (3E6). Larger exponents up to about n=6M are still being sieved but the latest output files are already well sieved and can be used for prime search.

In short, for k<10000 use the Psieve files and give credit to them, for k>10000 sieve yourself using srsieve.