[go: up one dir, main page]

login
A141377
a(n) = the smallest positive integer non-coprime to both n and d(n), where d(n) is the number of divisors of n.
3
2, 6, 6, 10, 2, 14, 2, 3, 2, 22, 2, 26, 2, 6, 10, 34, 2, 38, 2, 6, 2, 46, 2, 15, 2, 6, 2, 58, 2, 62, 2, 6, 2, 10, 3, 74, 2, 6, 2, 82, 2, 86, 2, 3, 2, 94, 2, 21, 2, 6, 2, 106, 2, 10, 2, 6, 2, 118, 2, 122, 2, 3, 14, 10, 2, 134, 2, 6, 2, 142, 2, 146, 2, 3, 2, 14, 2, 158, 2, 15, 2, 166, 2, 10, 2, 6
OFFSET
2,1
LINKS
FORMULA
a(n) = A141327(n, A000005(n)).
PROG
(PARI) A141377(n) = { my(d=numdiv(n)); for(k=2, oo, if(gcd(k, n)>1 && gcd(k, d)>1, return(k))); }; \\ Antti Karttunen, Feb 18 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Jun 28 2008
EXTENSIONS
Extended by Ray Chandler, Jun 24 2009
STATUS
approved