login
A009194
a(n) = gcd(n, sigma(n)).
114
1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 12, 1, 2, 1, 28, 1, 6, 1, 1, 3, 2, 1, 1, 1, 2, 1, 10, 1, 6, 1, 4, 3, 2, 1, 4, 1, 1, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 3, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 28, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 1, 3, 1, 1, 6, 1, 2
OFFSET
1,6
COMMENTS
LCM of common divisors of n and sigma(n). It equals n if n is multiply perfect (A007691). - Labos Elemer, Aug 14 2002
LINKS
P. Pollack, On the greatest common divisor of a number and its sum of divisors, Michigan Math. J. Volume 60, Issue 1 (2011), 199-214.
FORMULA
A000005(a(n)) = A073802(n). - Reinhard Zumkeller, Mar 12 2010
A006530(a(n)) = A082062(n). - Reinhard Zumkeller, Jul 10 2011
a(A014567(n)) = 1; A069059(a(n)) > 1. - Reinhard Zumkeller, Mar 23 2013
a(n) = n/A017666(n). - Antti Karttunen, May 22 2017
MATHEMATICA
Table[GCD[n, DivisorSigma[1, n]], {n, 110}] (* Harvey P. Dale, Aug 23 2015 *)
PROG
(Haskell)
a009194 n = gcd (a000203 n) n -- Reinhard Zumkeller, Mar 23 2013
(PARI) a(n) = gcd(n, sigma(n)); \\ Michel Marcus, Oct 23 2013
KEYWORD
nonn
STATUS
approved