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 A073071 #16 Jul 04 2021 10:44:07
%S A073071 3,4,5,6,7,8,10,11,12,14,15,16,17,19,20,21,23,24,25,27,28,29,31,32,33,
%T A073071 34,36,37,38,40,41,42,44,45,46,47,49,50,51,53,54,55,57,58,59,60,62,63,
%U A073071 64,66,67,68,70,71,72,73,75,76,77,79,80,81,83,84,85,86,88,89
%N A073071 Least k such that k! > prime(1)*prime(2)*...*prime(n) where prime(n) is the n-th prime.
%C A073071 If the greater than sign in the definition is replaced by >=, we get A048964. - _R. J. Mathar_, May 01 2008
%H A073071 David Wilson, <a href="/A073071/b073071.txt">Table of n, a(n) for n = 1..10000</a>
%F A073071 a(n) should be asymptotic to C*n (where 1<C<3/2).
%e A073071 n=1: prime(1) = 2, 3! > 2, a(1) = 3.
%e A073071 n=2: prime(1)*prime(2) = 6, 4! > 6, a(2) = 4.
%t A073071 Module[{nn=100,prmorl,fctorl},prmolr=FoldList[Times, Prime[Range[ nn]]]; fctorl=Range[nn]!;Table[Position[fctorl,_?(#>prmolr[[n]]&),1,1],{n,70}]]//Flatten (* _Harvey P. Dale_, Jul 04 2021 *)
%o A073071 (PARI) a(n) = my(k=1, p=vecprod(primes(n))); while(k! <= p, k++); k; \\ _Michel Marcus_, Feb 18 2021
%Y A073071 Cf. A002110, A048964, A135667.
%K A073071 easy,nonn
%O A073071 1,1
%A A073071 _Benoit Cloitre_, Aug 17 2002
%E A073071 Corrected by Peter Pein (petsie(AT)dordos.net), May 01 2008