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

Links

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

Formula

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

Prog

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

Crossrefs

Cf. A003958, A345046.

Cf. also A345045, A353784.

Sequence in context: A085856 A132126 A324882 * A031264 A345045 A318809

Adjacent sequences: A345044 A345045 A345046 * A345048 A345049 A345050

Keyword

nonn

Author

Antti Karttunen, Jun 07 2021

Status

approved