The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326698 a(n) is the product of divisors d of n such that sigma(d) divides n. 4
1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 36, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 36, 1, 1, 1, 4, 1, 10, 1, 1, 1, 1, 1, 36, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 36, 1, 1, 1, 1, 1, 2, 1, 784, 1, 1, 1, 180, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 36, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
a(A097603(n)) > 1.
See A173441 and A326697 for number and sum such divisors.
LINKS
EXAMPLE
For n = 12, divisors d of 12: 1, 2, 3, 4, 6, 12;
corresponding sigma(d): 1, 3, 4, 7, 12, 28;
sigma(d) divides n for 4 divisors d: 1, 2, 3, 6;
a(12) = 1 * 2 * 3 * 6 = 36.
MATHEMATICA
a[n_] := Times @@ Select[Divisors[n], Divisible[n, DivisorSigma[1, #] &]]; Array[a, 100] (* Amiram Eldar, Jul 21 2019 *)
PROG
(Magma) [&*[d: d in Divisors(n) | IsIntegral(n / SumOfDivisors(d))]: n in [1..100]]
(PARI) a(n) = my(p=1); fordiv(n, d, if (!(n % sigma(d)), p *= d)); p; \\ Michel Marcus, Jul 19 2019
CROSSREFS
Sequence in context: A327156 A114171 A154243 * A299432 A252911 A176820
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jul 19 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 04:26 EDT 2024. Contains 372921 sequences. (Running on oeis4.)