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 A102721 #13 Dec 23 2017 17:29:36 %S A102721 0,6,8,14,18,20,24,36,38,48,50,54,60,66,68,74,84,96,98,108,110,116, %T A102721 126,134,138,140,144,146,150,168,176,180,188,200,216,218,224,228,230, %U A102721 236,246,248,258,264,266,276,284,288,290,300,314,318 %N A102721 Numbers n such that 11*n + 13 is prime. %H A102721 Harvey P. Dale, <a href="/A102721/b102721.txt">Table of n, a(n) for n = 1..1000</a> %e A102721 If n=0, then 11*0 + 13 = 13 (prime). %e A102721 If n=50, then 11*50 + 13 = 563 (prime). %e A102721 If n=108, then 11*108 + 13 = 1201 (prime). %t A102721 For[n = 1, n < 320, n++, If[PrimeQ[11*n + 13], Print[n]]] (* _Stefan Steinerberger_, Feb 15 2006 *) %t A102721 Select[Range[0,400,2],PrimeQ[11#+13]&] (* _Harvey P. Dale_, Dec 23 2017 *) %o A102721 (PARI) is(n)=isprime(11*n+13) \\ _Charles R Greathouse IV_, Jun 12 2017 %K A102721 nonn,easy %O A102721 1,2 %A A102721 _Parthasarathy Nambi_, Feb 06 2005 %E A102721 More terms from _Stefan Steinerberger_, Feb 15 2006