|
|
A116617
|
|
Values of n such that prime(2n+1) mod 12 = 11.
|
|
8
|
|
|
2, 4, 7, 8, 11, 19, 20, 21, 24, 34, 40, 41, 45, 51, 53, 54, 80, 85, 86, 92, 97, 102, 107, 109, 112, 119, 120, 126, 138, 140, 141, 149, 153, 154, 155, 157, 158, 164, 174, 178, 181, 188, 196, 197, 206, 208, 211, 213, 220, 226, 231, 236, 237, 239, 247, 253, 255, 259
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
40 is in the sequence because the 81st prime is 419 and 419 mod 12 = 11.
|
|
MAPLE
|
a:=proc(n) if ithprime(2*n+1) mod 12 = 11 then n else fi end: seq(a(n), n=0..310);
|
|
MATHEMATICA
|
Select[Range[1, 500], Mod[Prime[2*# + 1], 12] == 11 &] (* G. C. Greubel, Nov 19 2017 *)
|
|
PROG
|
(PARI) for(n=1, 500, print1(prime(2*n+1)%12==11, ", ")) \\ G. C. Greubel, Nov 19 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|