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 A115956 #10 Aug 04 2025 20:19:14
%S A115956 6,10,14,15,20,21,22,26,28,33,34,35,38,39,44,46,51,52,55,57,58,62,65,
%T A115956 68,69,74,76,77,82,85,86,87,88,91,92,93,94,95,99,104,106,111,115,116,
%U A115956 117,118,119,122,123,124,129,133,134,136,141,142,143,145,146,148,152,153
%N A115956 Numbers k having exactly 2 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 2 distinct prime factors).
%e A115956 20 is in the sequence because it has 2 distinct prime factors (2 and 5) and 5 > sqrt(20).
%p A115956 with(numtheory): a:=proc(n) if nops(factorset(n))=2 and factorset(n)[2]^2>=n then n else fi end: seq(a(n),n=1..170);
%t A115956 tdpfQ[n_]:=Module[{fi=FactorInteger[n]},Length[fi]==2&&fi[[2,1]]>Sqrt[n]]; Select[Range[ 200],tdpfQ] (* _Harvey P. Dale_, Aug 07 2023 *)
%Y A115956 Cf. A115957, A115958, A115959, A115960, A115961.
%K A115956 nonn
%O A115956 1,1
%A A115956 _Emeric Deutsch_, Feb 02 2006