Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #18 Nov 20 2017 05:32:07
%S 5,9,13,15,23,30,31,33,36,37,42,46,47,49,50,52,55,57,58,62,64,65,66,
%T 70,71,74,76,77,78,81,83,87,88,89,90,96,103,106,108,114,116,117,121,
%U 123,124,130,134,142,144,148,151,152,160,163,166,167,175,182,185,191,192
%N Values of n such that prime(2n+1) mod 12 = 7.
%H G. C. Greubel, <a href="/A116616/b116616.txt">Table of n, a(n) for n = 1..1000</a>
%F Equals { odd terms in A160592 = A000720(A068229) } / 2, rounded towards zero. - _M. F. Hasler_, May 22 2009
%e 33 is in the sequence because the 67th prime is 331 and 331 mod 12=7.
%p a:=proc(n) if ithprime(2*n+1) mod 12 = 7 then n else fi end: seq(a(n),n=0..215);
%t Select[Range[220], Mod[Prime[2# + 1], 12] == 7 &] (* _Stefan Steinerberger_, Apr 08 2006 *)
%o (PARI) for(n=1,999, prime(2*n+1)%12==7 & print1(n",")) \\ _M. F. Hasler_, May 22 2009
%Y Cf. A116602, A116610, A116612-A116617, A160591-A160594. [_M. F. Hasler_, May 22 2009]
%K nonn
%O 1,1
%A _Roger L. Bagula_, Mar 29 2006
%E Edited by _N. J. A. Sloane_, Apr 05 2006