login
A083259
a(n) = gcd(n, A071364(n)), where A071364(n) is the smallest number with same sequence of exponents in canonical prime factorization as n.
3
1, 2, 1, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 3, 16, 1, 18, 1, 4, 3, 2, 1, 24, 1, 2, 1, 4, 1, 30, 1, 32, 3, 2, 1, 36, 1, 2, 3, 8, 1, 6, 1, 4, 3, 2, 1, 48, 1, 2, 3, 4, 1, 54, 1, 8, 3, 2, 1, 60, 1, 2, 3, 64, 1, 6, 1, 4, 3, 10, 1, 72, 1, 2, 3, 4, 1, 6, 1, 16, 1, 2, 1, 12, 1, 2, 3, 8, 1, 90, 1, 4, 3, 2, 1, 96, 1
OFFSET
1,2
PROG
(PARI)
A071364(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 1] = prime(i)); factorback(f); }; \\ From A071364
A083259(n) = gcd(A071364(n), n); \\ Antti Karttunen, Jan 22 2020
KEYWORD
nonn
AUTHOR
Labos Elemer, May 09 2003
STATUS
approved