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.

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, 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, 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

Offset

1,8

Links

Antti Karttunen, Table of n, a(n) for n = 1..20000

Index entries for sequences related to sigma(n)

Formula

a(n) = A348944(n) - A000203(n) = ((1/2) * (A003959(n)+A034448(n))) - A000203(n).

a(n) = (1/2) * (A348029(n)-A048146(n)).

Mathematica

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 *)

Prog

(PARI)
A003959(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]++); factorback(f); };
A034448(n) = { my(f = factor(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); };
A348944(n) = ((1/2)*(A003959(n)+A034448(n)));
A348945(n) = (A348944(n)-sigma(n));

Crossrefs

Cf. A000203, A003959, A034448, A048146, A348029, A348944, A348946.

Sequence in context: A366076 A324326 A341743 * A151755 A325739 A181004

Adjacent sequences: A348942 A348943 A348944 * A348946 A348947 A348948

Keyword

nonn

Author

Antti Karttunen, Nov 05 2021

Status

approved