A345047 a(n) = A003958(n) / A345046(n), where A003958(n) is multiplicative with a(p^e) = (p-1)^e, and A345046(n) gives the least common multiple of the same factors.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 4, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 4, 1, 2, 1, 1, 4, 6, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4

Offset: 1

Author

Antti Karttunen, Jun 07 2021

Keywords

• nonn

Links

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

Crossrefs

Cf. A003958, A345046.

Cf. also A345045, A353784.

Programs

PARI

A345047(n) = { my(f=factor(n)~, g=vector(#f, i, (f[1, i]-1)^f[2, i])); factorback(g)/lcm(g); };

Formula

a(n) = A003958(n) / A345046(n).