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 A177013 #13 Mar 07 2018 06:48:13
%S A177013 3,3,3,3,3,1500,1500,154770,1656252,3240034842
%N A177013 a(n) is the smallest number m such that all the n numbers 1!*m-1, 2!*m-1, ..., n!*m-1 are prime.
%e A177013 a(5)=3 because all five numbers 1!*3-1, 2!*3-1, 3!*3-1, 4!*3-1 and 5!*3-1 are prime and 3 is the smallest such number.
%e A177013 The corresponding primes are:
%e A177013 n=1: 2;
%e A177013 n=2: 2, 5;
%e A177013 n=3: 2, 5, 17;
%e A177013 n=4: 2, 5, 17, 71;
%e A177013 n=5: 2, 5, 17, 71, 359;
%e A177013 n=6: 1499, 2999, 8999, 35999, 179999, 1079999;
%e A177013 n=7: 1499, 2999, 8999, 35999, 179999, 1079999, 7559999;
%e A177013 n=8: 154769, 309539, 928619, 3714479, 18572399, 111434399, 780040799, 6240326399;
%e A177013 ...
%o A177013 (PARI) okm(m, n) = {for (k=1, n, if (! isprime(k!*m-1), return (0));); return (1);}
%o A177013 a(n) = {m = 1; while(! okm(m, n), m++); m;} \\ _Michel Marcus_, Jun 08 2014
%Y A177013 Cf. A177014.
%K A177013 more,nonn
%O A177013 1,1
%A A177013 _Enoch Haga_ and _Farideh Firoozbakht_, May 20 2010