A373246 Greatest common divisor of n and its prime shadow: a(n) = gcd(n, A181819(n)).

1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 6, 1, 2, 1, 1, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 9, 1, 2, 1, 10, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 12, 1, 2, 3, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 12, 1, 2, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 1

Offset

1,2

Links

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

Formula

a(n) = gcd(A181819(n), A373247(n)).

a(n) = A181819(n) / A373249(n).

Prog

(PARI)
A181819(n) = factorback(apply(e->prime(e), (factor(n)[, 2])));
A373246(n) = gcd(n, A181819(n));

Crossrefs

Cf. A181819, A373247, A373249.

Cf. A325755 [numbers k for which a(k) = A181819(k)], A353566 (their characteristic function).

Sequence in context: A118107 A236548 A249949 * A155798 A055652 A290084

Adjacent sequences: A373243 A373244 A373245 * A373247 A373248 A373249

Keyword

nonn

Author

Antti Karttunen, May 29 2024

Status

approved