This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A116615 #19 Nov 20 2017 05:31:59
%S A116615 2,4,7,11,17,18,19,23,24,29,45,57,69,94,101,105,111,112,116,121,129,
%T A116615 133,136,137,138,141,150,157,162,164,170,172,174,177,184,187,197,203,
%U A116615 207,209,220,231,235,239,245,250,251,252,254,255,260,261,270,273,276,283
%N A116615 Values of n such that prime(2n) mod 12 = 7.
%H A116615 G. C. Greubel, <a href="/A116615/b116615.txt">Table of n, a(n) for n = 1..1000</a>
%F A116615 Equals (1/2) * { even terms in A160592 = A000720(A068229) }. - _M. F. Hasler_, May 22 2009
%e A116615 23 is in the sequence because the 46th prime is 199 and 199 mod 12=7.
%p A116615 a:=proc(n) if ithprime(2*n) mod 12 = 7 then n else fi end: seq(a(n),n=1..300);
%t A116615 Select[Range[1, 500], Mod[Prime[2*#], 12] == 7 &] (* _G. C. Greubel_, Nov 19 2017 *)
%o A116615 (PARI) for( n=1,999, prime(2*n)%12==7 & print1(n",")) \\ _M. F. Hasler_, May 22 2009
%Y A116615 Cf. A116602, A116610, A116612-A116617, A160591-A160594. [_M. F. Hasler_, May 22 2009]
%K A116615 nonn
%O A116615 1,1
%A A116615 _Roger L. Bagula_, Mar 29 2006
%E A116615 Edited by _N. J. A. Sloane_, Apr 05 2006