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 A238896 #13 Sep 23 2022 07:14:00
%S A238896 0,1,2,3,5,6,8,9,10,13,15,20,21,24,25,27,32,34,41,44,46,56,59,70,74,
%T A238896 76,86,92,99,115,116,129,138,145,156,164,169,171,193,199,222,223,242,
%U A238896 246,268,270,278,295,304,334,343,365,397,398,433,452,471,482,521
%N A238896 Number of times that the number A238895(n) occurs in the sum of proper divisors function (A001065).
%H A238896 Amiram Eldar, <a href="/A238896/b238896.txt">Table of n, a(n) for n = 1..245</a>
%F A238896 a(n) = A048138(A238895(n)). - _Amiram Eldar_, Sep 23 2022
%t A238896 nn = 1000; s = Table[0, {nn}]; Do[k = DivisorSigma[1, n] - n; If[0 < k <= nn, s[[k]]++], {n, nn^2}]; mx = -1; t = {}; Do[If[s[[n]] > mx, mx = s[[n]]; AppendTo[t, {n, mx}]], {n, 2, nn}]; Transpose[t][[2]]
%Y A238896 Cf. A001065, A005114, A048138, A238895.
%K A238896 nonn
%O A238896 1,3
%A A238896 _T. D. Noe_, Mar 10 2014