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 A376158 #28 Oct 04 2024 16:56:59
%S A376158 6,10,14,15,20,21,22,26,28,30,33,34,38,39,40,42,44,45,46,50,51,52,56,
%T A376158 57,58,60,62,63,66,68,69,70,74,75,76,78,80,82,84,86,87,88,90,92,93,94,
%U A376158 98,99,100,102,104,105,106,110,111,112,114,116,117,118,120,122,123,124,126,129,130,132,134,136,138,140,141,142,145
%N A376158 Numbers k having two prime divisors p < q such that p! <= k <= q!.
%C A376158 Different from A330136.
%H A376158 Alois P. Heinz, <a href="/A376158/b376158.txt">Table of n, a(n) for n = 1..10000</a>
%e A376158 40 is in the list because 40 has at least 2 distinct prime divisors, and the smallest prime divisor of 40 is 2 and the largest prime divisor of 40 is 5, and 2! <= 40 <= 5! because 2! = 2 and 5! = 120.
%p A376158 q:= n-> (s-> nops(s)>1 and min(s)!<=n and n<=max(s)!)(numtheory[factorset](n)):
%p A376158 select(q, [$2..150])[]; # _Alois P. Heinz_, Sep 20 2024
%t A376158 q[k_] := Module[{p = FactorInteger[k][[;; , 1]]}, Length[p] > 1 && k >= p[[1]]! && k <= p[[-1]]!]; Select[Range[125], q] (* _Amiram Eldar_, Sep 20 2024 *)
%Y A376158 Cf. A020639, A006530, A330136.
%K A376158 nonn
%O A376158 1,1
%A A376158 _Mike Jones_, Sep 12 2024