A323160 a(n) = gcd(n, A323159(n)) = gcd(n, A034448(n), A048250(n)).

1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 1, 2, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 2, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 6, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 2, 3, 2, 1, 6, 1, 2, 3

Offset: 1

Author

Antti Karttunen, Jan 09 2019

Keywords

• nonn

Links

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

Crossrefs

Cf. A034448, A048250, A323159, A323163, A323166.

Programs

PARI

A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; \\ After code in A034448
A048250(n) = factorback(apply(p -> p+1,factor(n)[,1]));
A323160(n) = gcd(n, gcd(A034448(n), A048250(n)));

Formula

a(n) = gcd(n, A323159(n)) = gcd(A048250(n), A323166(n)).

a(n) = gcd(n, A034448(n), A048250(n)).