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 A336442 #9 Jul 26 2020 02:34:09
%S A336442 60,120,140,180,210,240,280,300,315,360,420,462,480,504,540,560,600,
%T A336442 616,630,660,693,700,720,728,770,780,792,819,840,900,910,924,936,945,
%U A336442 960,980,990,1001,1008,1020,1050,1080,1092,1120,1140,1144,1170,1200,1232,1260
%N A336442 Numbers having 3 pairwise coprime divisors, {d_1, d_2, d_3}, such that d_1 < d_2 < d_3 < 2*d_1.
%C A336442 Erdős (1970) proved that the asymptotic density of this sequence exists and is less than 1.
%C A336442 The numbers of terms not exceeding 10^k for k = 1, 2, ... are 0, 1, 37, 543, 6529, 73578, 798916, 8480417, 88832422, ...
%C A336442 Any positive multiple of any term of this sequence is also a term. The primitive terms are in A336443.
%H A336442 Amiram Eldar, <a href="/A336442/b336442.txt">Table of n, a(n) for n = 1..10000</a>
%H A336442 Paul Erdős, <a href="https://www.renyi.hu/~p_erdos/1970-21.pdf">Some extremal problems in combinatorial number theory</a>, in the book Hari Shankar (ed.), Mathematical Essays Dedicated to A. J. Macintyre, Ohio Univ. Press, Athens, Ohio (1970), pp. 123-133.
%e A336442 60 is a term since {3, 4, 5} are divisors of 60, gcd(3,4) = gcd(4,5) = gcd(3,5) = 1 and 3 < 4 < 5 < 2*3.
%t A336442 divQ[n_] := AnyTrue[Subsets[Divisors[n], {3}], And @@ CoprimeQ @@@ Subsets[#, {2}] && #[[3]] < 2 * #[[1]] &]; Select[Range[1500], divQ]
%Y A336442 Subsequence of A005279.
%Y A336442 A336443 is a subsequence.
%K A336442 nonn
%O A336442 1,1
%A A336442 _Amiram Eldar_, Jul 21 2020