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 A116617 #17 Nov 20 2017 05:32:18 %S A116617 2,4,7,8,11,19,20,21,24,34,40,41,45,51,53,54,80,85,86,92,97,102,107, %T A116617 109,112,119,120,126,138,140,141,149,153,154,155,157,158,164,174,178, %U A116617 181,188,196,197,206,208,211,213,220,226,231,236,237,239,247,253,255,259 %N A116617 Values of n such that prime(2n+1) mod 12 = 11. %H A116617 G. C. Greubel, <a href="/A116617/b116617.txt">Table of n, a(n) for n = 1..1000</a> %e A116617 40 is in the sequence because the 81st prime is 419 and 419 mod 12 = 11. %p A116617 a:=proc(n) if ithprime(2*n+1) mod 12 = 11 then n else fi end: seq(a(n),n=0..310); %t A116617 Select[Range[1, 500], Mod[Prime[2*# + 1], 12] == 11 &] (* _G. C. Greubel_, Nov 19 2017 *) %o A116617 (PARI) for(n=1, 500, print1(prime(2*n+1)%12==11, ", ")) \\ _G. C. Greubel_, Nov 19 2017 %K A116617 nonn %O A116617 1,1 %A A116617 _Roger L. Bagula_, Mar 29 2006 %E A116617 Edited by _N. J. A. Sloane_, Apr 05 2006