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 A116612 #14 Oct 28 2017 10:48:15
%S A116612 10,12,14,18,26,29,32,60,63,72,73,75,79,84,91,93,94,95,98,101,105,110,
%T A116612 115,118,125,128,131,135,136,137,139,143,147,150,159,165,168,169,170,
%U A116612 173,177,180,184,187,195,200,203,205,207,212,215,217,218,221,222,224
%N A116612 Values of n such that p(2n+1) mod 12 = 1, where p(j) denotes the j-th prime.
%H A116612 G. C. Greubel, <a href="/A116612/b116612.txt">Table of n, a(n) for n = 1..5000</a>
%F A116612 A116612 = integer part of 1/2 * { odd terms in A160594 = A000720(A068228) }. - _M. F. Hasler_, May 22 2009
%e A116612 29 is in the sequence because the 59th prime is 277 and 277 mod 12=1.
%p A116612 a:=proc(n) if ithprime(2*n+1) mod 12 = 1 then n else fi end: seq(a(n),n=0..250);
%t A116612 Select[Range[0, 2000], Mod[Prime[2*# + 1], 12] == 1 &] (* _G. C. Greubel_, Oct 27 2017 *)
%o A116612 (PARI) for(n=1,999, prime(2*n+1)%12==1 & print1(n",")) \\ _M. F. Hasler_, May 22 2009
%Y A116612 Cf. A116602, A116610, A116613-A116617, A160591-A160594. [_M. F. Hasler_, May 22 2009]
%K A116612 nonn
%O A116612 1,1
%A A116612 _Roger L. Bagula_, Mar 29 2006
%E A116612 Edited by _N. J. A. Sloane_, Apr 05 2006