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 A348945 #13 Feb 11 2022 11:23:43 %S A348945 0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,12,0,0,6,0,0,0,0,75,0, %T A348945 0,0,6,0,0,0,18,0,0,0,0,0,0,0,72,0,0,0,0,0,18,0,24,0,0,0,0,0,0,0,270, %U A348945 0,0,0,0,0,0,0,66,0,0,0,0,0,0,0,108,48,0,0,0,0,0,0,36,0,0,0,0,0,0,0,300,0,0,0,10 %N A348945 a(n) = A348944(n) - sigma(n), where A348944 is the arithmetic mean of A003959 and A034448, and sigma is the sum of divisors function. %H A348945 Antti Karttunen, <a href="/A348945/b348945.txt">Table of n, a(n) for n = 1..20000</a> %H A348945 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %F A348945 a(n) = A348944(n) - A000203(n) = ((1/2) * (A003959(n)+A034448(n))) - A000203(n). %F A348945 a(n) = (1/2) * (A348029(n)-A048146(n)). %t A348945 f1[p_, e_] := (p^(e + 1) - 1)/(p - 1); f2[p_, e_] := (p + 1)^e; f3[p_, e_] := p^e + 1; a[1] = 0; a[n_] := (Times @@ f2 @@@ (f = FactorInteger[n]) + Times @@ f3 @@@ f) / 2 - Times @@ f1 @@@ f; Array[a, 100] (* _Amiram Eldar_, Nov 05 2021 *) %o A348945 (PARI) %o A348945 A003959(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]++); factorback(f); }; %o A348945 A034448(n) = { my(f = factor(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; %o A348945 A348944(n) = ((1/2)*(A003959(n)+A034448(n))); %o A348945 A348945(n) = (A348944(n)-sigma(n)); %Y A348945 Cf. A000203, A003959, A034448, A048146, A348029, A348944, A348946. %K A348945 nonn %O A348945 1,8 %A A348945 _Antti Karttunen_, Nov 05 2021