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 A267123 #18 Feb 23 2016 09:55:26
%S A267123 11,15,99,231,351,455,725,3525,4935,5405,5709,7575,7641,12545,12891,
%T A267123 13749,16065,19859,20475,23969,27791,28049,28571,42459,54615,58755,
%U A267123 61979,64481,71835,81011,86261,88649
%N A267123 Integers n such that n+2!, n+2!+3!, n+2!+3!+4!, n+2!+3!+4!+5!, n+2!+3!+4!+5!+6!, and n+2!+3!+4!+5!+6!+7! are all prime.
%H A267123 Charles R Greathouse IV, <a href="/A267123/b267123.txt">Table of n, a(n) for n = 1..10000</a>
%e A267123 99+2!=101 (is prime)
%e A267123 99+2!+3!=107 (is prime)
%e A267123 99+2!+3!+4!=131 (is prime)
%e A267123 99+2!+3!+4!+5!=251 (is prime)
%e A267123 99+2!+3!+4!+5!+6!=971 (is prime)
%e A267123 99+2!+3!+4!+5!+6!+7!=6011 (is prime)
%t A267123 r = {2, 8, 32, 152, 872, 5912}; fQ[n_] := Union[ PrimeQ[n + r]] == {True}; Select[ Range@ 100000, fQ] (* _Robert G. Wilson v_, Jan 10 2016 *)
%o A267123 (PARI) is(n)=for(k=2,7,if(!isprime(n+=k!), return(0))); 1 \\ _Charles R Greathouse IV_, Feb 23 2016
%o A267123 (PARI) list(lim)=my(v=List(),p=2,q=3,g,n); forprime(r=5,lim+8, g=q-p; if(g>6 || (g<6 && r-p>6), p=q;q=r; next); n=p+6; for(k=4,7, if(!isprime(n+=k!), p=q;q=r;next(2))); listput(v,p-2);p=q;q=r); Vec(v) \\ _Charles R Greathouse IV_, Feb 23 2016
%Y A267123 Cf. A054116, A267125.
%K A267123 nonn
%O A267123 1,1
%A A267123 _Emre APARI_, Jan 10 2016