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 A336304 #46 Feb 16 2025 08:34:00
%S A336304 1,4,32,2178,416417176
%N A336304 a(n) is the least number k such that the average number of prime divisors of {1..k} counted with multiplicity is >= n.
%H A336304 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeFactor.html">Prime Factor</a>.
%e A336304 a(1) = 4 since the average number of prime divisors of {1..4} counted with multiplicity equals (0 + 1 + 1 + 2)/4 = 1 which is >= 1 and this is the least such number.
%e A336304 a(3) = 2178 because the average number of prime divisors of {1..2178} counted with multiplicity is >= 3 and this is the least such number.
%t A336304 s[n_] := Module[{m = 0, c = 0, k = 1, sum = 0, seq = {}}, While[c < n, sum += PrimeOmega[k]; If[sum >= m*k, c++; AppendTo[seq, k]; m++]; k++]; seq]; s[4] (* _Amiram Eldar_, Nov 18 2020 *)
%o A336304 (PARI) a(n)=my(m=0,k=1);while(k>0, m+=bigomega(k); if(m>=k*n,break);k++);k \\ _Derek Orr_, Nov 18 2020
%Y A336304 Cf. A001222, A022559, A085829, A328331, A338891, A338943.
%K A336304 nonn,more
%O A336304 0,2
%A A336304 _Ilya Gutkovskiy_, Nov 18 2020