The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306682 a(n) = gcd(sigma(n), pod(n)) where sigma(k) = the sum of the divisors of k (A000203) and pod(k) = the product of the divisors of k (A007955). 5
 1, 1, 1, 1, 1, 12, 1, 1, 1, 2, 1, 4, 1, 4, 3, 1, 1, 3, 1, 2, 1, 4, 1, 12, 1, 2, 1, 56, 1, 72, 1, 1, 3, 2, 1, 1, 1, 4, 1, 10, 1, 48, 1, 4, 3, 4, 1, 4, 1, 1, 9, 2, 1, 24, 1, 8, 1, 2, 1, 24, 1, 4, 1, 1, 1, 144, 1, 2, 3, 16, 1, 3, 1, 2, 1, 4, 1, 24, 1, 2, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS See A324527(n) = the smallest numbers k such that a(k) = n. LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 FORMULA a(n) = 1 for numbers in A014567. a(n) = tau(n) for numbers in A324526. EXAMPLE For n=6: a(6) = gcd(tau(6), pod(6)) = gcd(4, 36) = 4. PROG (MAGMA) [GCD(SumOfDivisors(n), &*[d: d in Divisors(n)]): n in [1.. 100]] (PARI) a(n) = my(d=divisors(n)); gcd(vecsum(d), vecprod(d)); \\ Michel Marcus, Mar 05 2019 CROSSREFS Cf. A000005, A000203, A007955, A009205, A046642, A120736, A324526, A324527. Sequence in context: A322732 A325827 A010208 * A327154 A334731 A010209 Adjacent sequences:  A306679 A306680 A306681 * A306683 A306684 A306685 KEYWORD nonn AUTHOR Jaroslav Krizek, Mar 05 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 1 02:09 EDT 2020. Contains 334758 sequences. (Running on oeis4.)