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 A337341 #10 Aug 24 2020 22:30:03
%S A337341 0,3,10,37,20,107,54,357,304,211,74,1001,132,95,598,3265,164,2795,246,
%T A337341 1965,1492,739,398,9089,1176,1275,7786,349,452,5483,654,29493,2080,
%U A337341 1591,2930,25277,804,2343,3574,17821,884,13571,1062,6801,15268,3739,1358,81965,7272,10755,4462,11653,1688,70259,4086,8765,6556,807
%N A337341 a(n) = A337339(n) - n.
%C A337341 Superficially, it seems that A000027 offers an lower bound for A337339 as there seems to be no negative terms in this sequence, but of course it is not guaranteed.
%H A337341 Antti Karttunen, <a href="/A337341/b337341.txt">Table of n, a(n) for n = 1..8191</a>
%H A337341 Antti Karttunen, <a href="/A337341/a337341.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A337341 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A337341 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A337341 a(n) = A337339(n) - n.
%o A337341 (PARI)
%o A337341 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A337341 A337341(n) = { my(h=A003961(n),s=(h^2),u=(s+1)/2); ((u/gcd(1+sigma(s), u)) - n); };
%Y A337341 Cf. A000027, A337339, A337340.
%K A337341 nonn
%O A337341 1,2
%A A337341 _Antti Karttunen_, Aug 24 2020