A324284 a(n) = gcd(n, A324283(n)).

1, 1, 3, 1, 1, 6, 1, 1, 3, 2, 1, 6, 1, 2, 3, 1, 1, 18, 1, 2, 3, 2, 1, 6, 25, 2, 3, 2, 1, 6, 1, 1, 3, 2, 5, 18, 1, 2, 3, 10, 1, 6, 1, 2, 45, 2, 1, 6, 7, 50, 3, 2, 1, 18, 5, 2, 3, 2, 1, 12, 1, 2, 3, 1, 5, 6, 1, 2, 3, 10, 1, 18, 1, 2, 75, 2, 1, 6, 1, 10, 3, 2, 1, 12, 5, 2, 3, 2, 1, 90, 1, 2, 3, 2, 5, 6, 1, 14, 9, 50, 1, 6, 1, 2, 15

Offset: 1

Author

Antti Karttunen, Feb 20 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..10000
• Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Crossrefs

Cf. A276086, A324283.

Programs

PARI

A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
A324283(n) = { my(f=factor(n)); prod(i=1, #f~, A276086(f[i,1]^f[i,2])); };
A324284(n) = gcd(n, A324283(n));

Formula

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