A324122 a(n) = sigma(n) - gcd(n*d(n), sigma(n)), where d(n) = number of divisors of n (A000005) and sigma(n) = sum of divisors of n (A000203).

0, 2, 2, 6, 4, 0, 6, 14, 12, 16, 10, 24, 12, 16, 12, 30, 16, 36, 18, 36, 28, 32, 22, 48, 30, 40, 36, 0, 28, 48, 30, 60, 36, 52, 44, 90, 36, 56, 52, 80, 40, 48, 42, 72, 72, 64, 46, 120, 54, 90, 60, 96, 52, 96, 68, 112, 76, 88, 58, 144, 60, 88, 102, 126, 80, 96, 66, 120, 84, 128, 70, 192, 72, 112, 122, 136, 92, 144, 78, 184, 120, 124, 82

Offset

1,2

Links

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

Antti Karttunen, Data supplement: n, a(n) computed for n = 1..117800

Formula

a(n) = A000203(n) - A324121(n) = A000203(n) - gcd(A000203(n), A038040(n)).

Prog

(PARI) A324122(n) = (sigma(n) - gcd(sigma(n), n*numdiv(n)));

Crossrefs

Cf. A000005, A000203, A038040, A106315, A106316, A324045, A324046, A324047, A324121.

Cf. A001599 (positions of zeros).

Sequence in context: A130728 A276085 A334870 * A324349 A092384 A061915

Adjacent sequences: A324119 A324120 A324121 * A324123 A324124 A324125

Keyword

nonn

Author

Antti Karttunen, Feb 15 2019

Status

approved