A324873 a(n) = gcd(n, A060968(n)).

1, 2, 1, 4, 1, 2, 1, 8, 3, 2, 1, 4, 1, 2, 1, 16, 1, 6, 1, 4, 1, 2, 1, 8, 5, 2, 9, 4, 1, 2, 1, 32, 3, 2, 1, 12, 1, 2, 3, 8, 1, 2, 1, 4, 3, 2, 1, 16, 7, 10, 1, 4, 1, 18, 1, 8, 1, 2, 1, 4, 1, 2, 3, 64, 1, 6, 1, 4, 3, 2, 1, 24, 1, 2, 5, 4, 1, 6, 1, 16, 27, 2, 1, 4, 1, 2, 1, 8, 1, 6, 1, 4, 1, 2, 5, 32, 1, 14, 9, 20, 1, 2, 1, 8, 1

Offset

1,2

Links

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

Formula

a(n) = gcd(n, A060968(n)).

Prog

(PARI)
A060968(n) = { my(f=factor(n)[, 1]); n*prod(i=if(n%2, 1, 2), #f, if(f[i]%4==1, 1-1/f[i], 1+1/f[i]))*if(n%4, 1, 2); }; \\ From A060968
A324873(n) = gcd(n, A060968(n));

Crossrefs

Cf. A060968, A235866 (positions of ones).

Sequence in context: A333763 A076775 A357689 * A325566 A218621 A079891

Adjacent sequences: A324870 A324871 A324872 * A324874 A324875 A324876

Keyword

nonn

Author

Antti Karttunen, May 18 2019

Status

approved