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 A357313 #9 Sep 28 2022 03:53:22
%S A357313 4,9,8,15,14,21,121,289,529,46,28,841,62,24,1369,217,2209,106,68,3481,
%T A357313 54,4489,134,5041,66,6241,158,6889,166,116,9409,10201,218,226,148,130,
%U A357313 114,16129,17161,18769,278,90,24649,314,26569,27889,108,29929,225,32041,244
%N A357313 a(n) is the unique number m such that A001065(m) = A057709(n).
%H A357313 Amiram Eldar, <a href="/A357313/b357313.txt">Table of n, a(n) for n = 1..10000</a>
%F A357313 A001065(a(n)) = A057709(n).
%e A357313 a(1) = 4 since 4 is the unique solution m to A001065(m) = A057709(1) = 3.
%t A357313 seq[max_] := Module[{s = t = Table[0, {n, 1, max}], i, j}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++; t[[i]] = n], {n, 2, (max - 1)^2}]; j = Position[s, 1] // Flatten; t[[j]]]; seq[250]
%Y A357313 Cf. A001065, A057709.
%K A357313 nonn
%O A357313 1,1
%A A357313 _Amiram Eldar_, Sep 23 2022