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 A301592 #10 Apr 15 2018 14:16:16
%S A301592 4,5,6,7,8,10,11,12,17,18,24,28,29,37,53,59,67,79,89,95,97,121,123,
%T A301592 125,223,305,329,479,521,539,541,905,1087,1147,1277,1345,1351,1355,
%U A301592 1357,5779,8923,10003,11773,12883,19371,19651,19657,28277,31445
%N A301592 Numbers k at which the ratio A288814(k) / k reaches a record high.
%e A301592 A288814(10) / 10 = 21 / 10 and for n < 10 all ratios are less than 21 / 10, so 10 is in the sequence.
%t A301592 Block[{s = Array[If[PrimeQ@ #, 0, Total@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger@ #]] &, 10^5, 2], t}, t = Table[(1 + FirstPosition[s, k][[1]])/k, {k, 4, LengthWhile[Differences@ Rest@ Union@ s, # == 1 &]}]; Map[3 + FirstPosition[t, #][[1]] &, Union@ FoldList[Max, t]]] (* _Michael De Vlieger_, Mar 26 2018 *)
%o A301592 (PARI) isok(k, n) = my(f=factor(k)); sum(j=1, #f~, f[j, 1]*f[j, 2]) == n;
%o A301592 f(n) = forcomposite(k=1, , if (isok(k, n), return(k))); /* A288814 */
%o A301592 lista(nn) = {maxr = 0; for (n=4, nn, if ((newr=f(n)/n) > maxr, print1(n, ", "); maxr = newr););} \\ _Michel Marcus_, Mar 26 2018
%Y A301592 Cf. A288814.
%K A301592 nonn
%O A301592 1,1
%A A301592 _David A. Corneth_, Mar 24 2018