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 A351457 #8 Feb 12 2022 23:47:51
%S A351457 0,-1,-2,8,-5,-6,-8,-4,14,-11,-6,8,-12,-18,-22,84,-14,-2,-20,-12,-36,
%T A351457 -18,-20,-24,0,-28,-40,-16,-29,-46,-18,40,-36,-32,-58,296,-28,-42,-56,
%U A351457 -44,-32,-76,-44,24,-66,-48,-44,136,8,-36,-64,-16,-50,-104,-66,-72,-84,-59,-30,-72,-50,-54,-100,1028,-92,-84,-66
%N A351457 a(n) = A351456(n) - A339905(n).
%H A351457 Antti Karttunen, <a href="/A351457/b351457.txt">Table of n, a(n) for n = 1..20000</a>
%H A351457 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A351457 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A351457 a(n) = A351445(A003961(n)) = A351456(n) - A339905(n).
%o A351457 (PARI)
%o A351457 A339905(n) = if(1==n,n,my(f=factor(n)); for(i=1,#f~,f[i,1] = nextprime(1+f[i,1])-1); factorback(f));
%o A351457 A003958(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f); };
%o A351457 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A351457 A351456(n) = A003958(sigma(A003961(n)));
%o A351457 A351457(n) = (A351456(n) - A339905(n));
%Y A351457 Cf. A000203, A003958, A003961, A003973, A339905, A351442, A351456.
%Y A351457 Cf. also A348736.
%K A351457 sign
%O A351457 1,3
%A A351457 _Antti Karttunen_, Feb 12 2022