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 A356593 #11 Aug 19 2022 10:09:02
%S A356593 1,2,3,3,3,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
%T A356593 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,6,6,6,6,
%U A356593 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6
%N A356593 Smallest k such that primorial(k) > n^2.
%t A356593 a[n_] := Module[{k = 1, prod = p = 2}, While[prod < n^2, p = NextPrime[p]; prod *= p; k++]; k]; Array[a, 100] (* _Amiram Eldar_, Aug 15 2022 *)
%o A356593 (Python)
%o A356593 from sympy import primorial
%o A356593 def a(n):
%o A356593 k = 1
%o A356593 while True:
%o A356593 if primorial(k) > n**2:
%o A356593 return(k)
%o A356593 k += 1
%o A356593 for n in range(1, 90):
%o A356593 print(f'{a(n)}, ', end='')
%Y A356593 Cf. A337769, A002110, A000290.
%K A356593 nonn
%O A356593 1,2
%A A356593 _Christoph B. Kassir_, Aug 14 2022