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 A337316 #50 Sep 30 2023 09:43:38
%S A337316 1729,12801,247105,1224721,2704801,5079361,8355841,26906881,30240001,
%T A337316 34479361,36426241,45318561,48188161,49871361,61485601,107714881,
%U A337316 170947105,178312321,193708801,393760321,446569201,475683841,740376001,781347841,878169601,987275521,1022304361
%N A337316 Composite numbers k such that phi(k) divides d*(k - 1) for some squarefree divisor d of k - 1.
%C A337316 All terms of this sequence are terms of A173703 (2-Lehmer numbers) and all Lehmer numbers (if there are any) are contained in this sequence.
%H A337316 Max Alekseyev, <a href="/A337316/b337316.txt">Table of n, a(n) for n = 1..114</a>
%e A337316 phi(247105) = 194688 divides 2 * 13 * 247104.
%t A337316 divQ[n_] := AnyTrue[Select[Divisors[n - 1], SquareFreeQ]*(n - 1), Divisible[#, EulerPhi[n]] &]; Select[Range[250000], CompositeQ[#] && divQ[#] &] (* _Amiram Eldar_, Oct 14 2020 *)
%o A337316 (PARI) is(n)={my(s=denominator((n-1)/eulerphi(n))); !isprime(n) && issquarefree(s) && ((n-1)%s==0) && n>1}
%o A337316 { forcomposite(n=1, 2^28, if(is(n), print1(n, ", "))) }
%Y A337316 Cf. A173703 (2-Lehmer numbers), A238574 (k-Lehmer numbers for some k).
%Y A337316 Cf. A000010 (phi), A005117 (squarefree numbers).
%K A337316 nonn
%O A337316 1,1
%A A337316 _Tomohiro Yamada_, Sep 28 2020
%E A337316 More terms from _Amiram Eldar_, Oct 14 2020