A343903 a(n) = Sum{i=1..A343901(n)} n (mod A343902(n, i)^2).

3, 0, 6, 2, 10, 8, 1, 3, 5, 3, 31, 7, 24, 23, 26, 2, 23, 22, 46, 6, 8, 30, 33, 37, 30, 32, 7, 10, 69, 12, 48, 18, 91, 47, 125, 42, 98, 19, 63, 67, 53, 71, 111, 3, 5, 26, 5, 57, 61, 64, 12, 7, 64, 71, 133, 14, 8, 16, 214, 85, 156, 79, 164, 87, 92, 91, 95, 120

Offset

3,1

Comments

A theorem of Pomerance says that if a(n) = 0, then A000010(x) = A000010(y) has only the solution y = x (cf. Pomerance, 1974).

Links

Table of n, a(n) for n=3..70.

Carl Pomerance, On Carmichael's conjecture, Proceedings of the American Mathematical Society 43 (1974), 297-298.

Wikipedia, Carmichael's totient function conjecture

Prog

(PARI) row_a343902(n) = my(e=eulerphi(n), v=[]); forprime(p=1, e, if(e%(p-1)==0, v=concat(v, [p]))); v
a(n) = my(v=row_a343902(n)); sum(i=1, #v, n%v[i]^2)

Crossrefs

Cf. A000010, A343901, A343902.

Sequence in context: A077187 A011079 A334874 * A339416 A226535 A005928

Adjacent sequences: A343900 A343901 A343902 * A343904 A343905 A343906

Keyword

nonn

Author

Felix Fröhlich, May 03 2021

Status

approved