proposed
approved
proposed
approved
editing
proposed
Antti Karttunen, <a href="/A141377/b141377.txt">Table of n, a(n) for n = 2..16385</a>
(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
approved
editing
Leroy Quet , Jun 28 2008
_Leroy Quet _ Jun 28 2008
Extended by _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Jun 24 2009
Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)
nonn,new
nonn
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
more,nonn,new
nonn
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 24 2009
a(n) = the smallest positive integer non-coprime to both n and d(n), where d(n) is the number of divisors of n.
2, 6, 6, 10, 2, 14, 2, 3, 2, 22, 2, 26, 2, 6, 10
2,1
Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> (listed in lieu of email address)
more,nonn
Leroy Quet Jun 28 2008
approved