login
A328231
a(n) = gcd(n, A048673(n)).
3
1, 2, 3, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 4, 7, 2, 1, 4, 25, 26, 9, 2, 1, 1, 1, 2, 33, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 3, 1, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 1, 2, 1, 4, 1, 1, 1, 4, 1, 1, 3, 88, 1, 1, 1, 1, 93, 2, 1, 32, 1, 14, 1, 1, 1, 1, 1, 2, 1
OFFSET
1,2
LINKS
FORMULA
a(n) = gcd(n, A048673(n)).
PROG
(PARI)
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
A048673(n) = (A003961(n)+1)/2;
A328231(n) = gcd(n, A048673(n));
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 08 2019
STATUS
approved