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 A275987 #15 Dec 20 2024 02:42:29
%S A275987 1,2,3,4,5,6,7,8,9,10,6,12,13,14,14,16,10,18,19,20,21,22,14,24,16,20,
%T A275987 27,28,29,30,21,32,33,34,33,36,37,24,28,40,20,42,43,44,45,30,33,48,49,
%U A275987 50,30,52,34,54,30,54,57,40,24,60,61,42,63,64,44,66,67,68,42,66,30,72,73,74,48
%N A275987 Least k such that sigma(k) = sigma(n).
%H A275987 Antti Karttunen, <a href="/A275987/b275987.txt">Table of n, a(n) for n = 1..16384</a>
%H A275987 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%H A275987 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>.
%e A275987 a(11) = 6 because sigma(6) = sigma(11) = 12.
%t A275987 With[{nn = 76}, With[{s = Values@ PositionIndex@ Array[DivisorSigma[1, #] &, nn]}, Array[s[[FirstPosition[s, #][[1]], 1 ]] &, nn]]] (* _Michael De Vlieger_, Nov 16 2017 *)
%o A275987 (PARI) a(n) = {my(k = 1); while(sigma(k) != sigma(n), k++); k; }
%o A275987 (PARI) a(n) = invsigmaMin(sigma(n)); \\ _Amiram Eldar_, Dec 20 2024, using _Max Alekseyev_'s invphi.gp
%Y A275987 Cf. A000203, A069822, A286603.
%K A275987 nonn
%O A275987 1,2
%A A275987 _Altug Alkan_, Aug 15 2016