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 A067111 #14 Sep 01 2023 15:38:55
%S A067111 1,1,3,12,82,732,8801,125970,2230928,50152660,1253503063,37668721496,
%T A067111 1278362451795,46557869507722,1874663971306376,85535849021496180,
%U A067111 4369909886714119634,234108545627558824317,13835073153310329323730
%N A067111 Floor[ Product of first n primes / Sum of first n primes].
%H A067111 Harry J. Smith, <a href="/A067111/b067111.txt">Table of n, a(n) for n = 1..100</a>
%F A067111 a(n) = floor(A002110(n)/A007504(n)). - _Michel Marcus_, Jul 16 2020
%e A067111 a(4) = floor(2*3*5*7/17) = floor(210/17) = 12.
%t A067111 Table[ Floor[ Product[ Prime[i], {i, 1, n} ] / Sum[ Prime[i], {i, 1, n} ]], {n, 1, 22} ]
%t A067111 Module[{nn=20,p,pr,sm},p=Prime[Range[nn]];pr=FoldList[Times,p];sm=Accumulate[p];Floor[ pr/sm]] (* _Harvey P. Dale_, Sep 01 2023 *)
%o A067111 (PARI) { t=1; s=0; for (n=1, 100, p=prime(n); t*=p; s+=p; write("b067111.txt", n, " ", floor(t/s)) ) } \\ _Harry J. Smith_, May 23 2010
%Y A067111 Cf. A002110 (product) and A007504 (sum) of first n primes.
%K A067111 easy,nonn
%O A067111 1,3
%A A067111 _Amarnath Murthy_, Jan 08 2002
%E A067111 More terms from _Robert G. Wilson v_, Jan 08 2002