Does PPsieve work?
 

Is there a sieve program I can use to find primes of the form k*2^6012+1 (of course I want to use this for larger examples, too).

I typed in the following expression in an input file:

k*2^6012+1
-----------------------------

And for SrSieve:

> srsieve_xx.exe -P 1e10 -k 1 -K 1e4 mysieve.txt

and did not sieve k. Is there some NewPgen format or other program I can use to sieve k values? Thanks, that would be helpful.

[QUOTE=PawnProver44;433232]Is there a sieve program I can use to find primes of the form k*2^6012+1 (of course I want to use this for larger examples, too).

I typed in the following expression in an input file:

k*2^6012+1
-----------------------------

And for SrSieve:

> srsieve_xx.exe -P 1e10 -k 1 -K 1e4 mysieve.txt

and did not sieve k. Is there some NewPgen format or other program I can use to sieve k values? Thanks, that would be helpful.[/QUOTE]

a quick start for sieving by hand:

6012 = 0 mod 2 so k*2^6012+1 is k+1 mod 3
6012 = 0 mod 4 so ... is k+1 mod 5
6012 = 0 mod 6 so ... is k+1 mod 7
6012 = 2 mod 10 so ... is 4*k+1 mod 11
6012 = 0 mod 12 so ... is k+1 mod 13
6012 = 12 mod 16 so ... is k+1 mod 17
...

Newpgen is probably a good choice for this search.

srsieve/sr1sieve is supposed to be faster, though. newpgen's strength is elsewhere (in many other modes).

One needs to read the help file (or the output of the program run without parameters or with -h); it is well known to be [I]decidedly[/I] not 'rocket surgery' to run sr*sieve.

[QUOTE=PawnProver44;433232]primes of the form k*2^6012+1[/QUOTE]

[QUOTE=Batalov;433265]srsieve/sr1sieve is supposed to be faster, though.[/QUOTE]
OP is looking for fixed-n variable k sieve. srsieve doesn't support it (efficiently). NewPGen (or maybe TwinGen?) is the way to go.

Ah, right, brainfart on my part. NewPGen it is for this form, right-o!

This is sieve file for our forum user [URL="http://www.mersenneforum.org/member.php?u=14778"]PawnProver44[/URL] in requested form. Since LLR time for this sequnece is measured in milliseconds ( 80-110 ms on AVX) you will find your own prime very fast.
But since ( reading last messages and post on this forum) you will not know how to process this file, I strongly suggest to admins to make forum only for you.
And here is image so you can make sieve by yourself

[URL]http://s32.postimg.org/drcxg5ao5/Clipboard02.jpg[/URL]

[COLOR=black][FONT=Verdana]Some of the PSieve[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana](K*2N+ and/or - 1)[/FONT][/COLOR][COLOR=black][FONT=Verdana] programs,[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana]based on Geoffrey Reynolds' GPL TPSieve source code[/FONT][/COLOR][COLOR=black][FONT=Verdana]:[/FONT][/COLOR]
[COLOR=black][FONT=Verdana]PSieve[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana] Source [/FONT][/COLOR][COLOR=black][FONT=Verdana]- for factors of numbers of the form K*2N+ or - 1[/FONT][/COLOR]
[COLOR=black][FONT=Verdana][/FONT][/COLOR][COLOR=black][FONT=Verdana]CUDA[/FONT][/COLOR][COLOR=black][FONT=Verdana]- a version for use with nVIDIA GPUs[/FONT][/COLOR][COLOR=black][FONT=Verdana][/FONT][/COLOR]
[COLOR=black][FONT=Verdana]PSieve[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana]OpenCL [/FONT][/COLOR][COLOR=black][FONT=Verdana]- a version for use with ATI/AMD GPUs[/FONT][/COLOR]
[COLOR=black][FONT=Verdana]TR PSieve[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana]-[/FONT][/COLOR][COLOR=black][FONT=Verdana] [/FONT][/COLOR][COLOR=black][FONT=Verdana]for finding[/FONT][/COLOR][COLOR=black][FONT=Verdana] twin primes [/FONT][/COLOR][COLOR=black][FONT=Verdana]of the same form[/FONT][/COLOR]