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 A116610 #17 Oct 28 2017 10:50:08
%S A116610 10,14,16,26,27,28,32,36,38,43,46,47,48,59,60,62,64,66,72,73,75,77,78,
%T A116610 82,83,91,95,96,100,104,107,114,115,118,120,123,124,125,128,131,140,
%U A116610 143,146,147,152,159,167,168,173,179,180,182,185,186,188,193,195,205,210
%N A116610 Values of n such that prime(2*n) mod 12 = 11.
%H A116610 G. C. Greubel, <a href="/A116610/b116610.txt">Table of n, a(n) for n = 1..5000</a>
%F A116610 A116610 = 1/2 { even terms in A160593 = A000720(A068231) } . - _M. F. Hasler_, May 22 2009
%e A116610 26 is in the sequence because the 52nd prime is 239 and 239 mod 12=11.
%p A116610 a:=proc(n) if ithprime(2*n) mod 12 = 11 then n else fi end: seq(a(n),n=1..250);
%t A116610 Select[Range[250],Mod[Prime[2#],12]==11&] (* _Harvey P. Dale_, Jan 30 2011 *)
%o A116610 (PARI) for(n=1,999, prime(2*n)%12==11 & print1(n",")) \\ _M. F. Hasler_, May 22 2009
%Y A116610 Cf. A116602, A116612-A116617, A160591-A160594. - _M. F. Hasler_, May 22 2009
%K A116610 nonn
%O A116610 1,1
%A A116610 _Roger L. Bagula_, Mar 29 2006
%E A116610 Edited by _N. J. A. Sloane_, Apr 05 2006