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 A115960 #12 Aug 04 2025 20:18:55
%S A115960 5338410,5389230,5403090,5407710,5421570,5430810,5444670,5477010,
%T A115960 5490870,5500110,5504730,5518590,5527830,5541690,5569410,5583270,
%U A115960 5597130,5629470,5638710,5652570,5680290,5698770,5712630,5721870
%N A115960 Numbers k having exactly 6 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 6 distinct prime factors).
%e A115960 5389230 is in the sequence because it has 6 distinct prime factors (2, 3, 5, 7, 11 and 2333) and 2333 > sqrt(5389230).
%p A115960 with(numtheory): a:=proc(n) if nops(factorset(n))=6 and factorset(n)[6]^2>=n then n else fi end: seq(a(n),n=(2*3*5*7*11)^2..5850000);
%t A115960 dpf6Q[n_]:=Module[{pf=FactorInteger[n][[All,1]]},Length[pf]==6 && pf[[6]]>=Sqrt[n]]; Select[Range[6*10^6],dpf6Q] (* _Harvey P. Dale_, Mar 24 2017 *)
%Y A115960 Cf. A115956, A115957, A115958, A115959, A115961.
%K A115960 nonn
%O A115960 1,1
%A A115960 _Emeric Deutsch_, Feb 02 2006