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 A087233 #13 Aug 10 2024 10:51:10
%S A087233 1,1,2,2,2,2,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,
%T A087233 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
%U A087233 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6
%N A087233 a(n) = floor(sigma(A002110(n))/A002110(n)); integer quotient of divisor-sum of primorial numbers and primorials.
%H A087233 Amiram Eldar, <a href="/A087233/b087233.txt">Table of n, a(n) for n = 0..10000</a>
%F A087233 From _Amiram Eldar_, Aug 10 2024: (Start)
%F A087233 a(n) = A108775(A002110(n)).
%F A087233 a(n) = floor(A054640(n)/A002110(n)).
%F A087233 a(n) = floor(Product_{k=1..n} (1 + 1/prime(k))). (End)
%t A087233 q[x_] := Apply[Times, Table[Prime[w], {w, 1, x}]]; q[0]=1; Table[Floor[DivisorSigma[1, a=q[u]]/q[u]//N], {u, 1, 300}]
%t A087233 seq[nmax_] := Floor[FoldList[Times, 1, 1 + 1/Prime[Range[nmax]]]]; seq[100] (* _Amiram Eldar_, Aug 10 2024 *)
%o A087233 (PARI) a(n) = floor(vecprod(apply(x -> 1 + 1/x, primes(n)))); \\ _Amiram Eldar_, Aug 10 2024
%Y A087233 Cf. A000203, A002110, A054640, A108775.
%K A087233 nonn,easy
%O A087233 0,3
%A A087233 _Labos Elemer_, Sep 01 2003
%E A087233 Offset changed to 0 and a(0) prepended by _Amiram Eldar_, Aug 10 2024