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!)
A334471 a(n) = Product_{d|n} (A069934(n) / sigma(d)) where A069934(n) = lcm_{d|n} sigma(d). 2
1, 3, 4, 441, 6, 144, 8, 385875, 2704, 324, 12, 12446784, 14, 576, 576, 37418184916875, 18, 197413632, 20, 42007896, 1024, 1296, 24, 38118276000000, 34596, 1764, 35152000, 99574272, 30, 26873856, 32, 1409355934894096875, 2304, 2916, 2304, 1695648500686393344 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = ((lcm_{d|n} sigma(d))^tau(n)) / Product_{d|n} (sigma(d)).
a(n) = A069934(n)^A000005(n) / A206032(n).
a(p) = p + 1 for p = primes (A000040).
EXAMPLE
For n = 6; divisors d of 6: {1, 2, 3, 6}; sigma(d): {1, 3, 4, 12}; lcm_{d|6} sigma(d) = 12; a(6) = 12/1 * 12/3 * 12/4 * 12/12 = 144.
MATHEMATICA
a[n_] := (LCM @@ (s = DivisorSigma[1, Divisors[n]]))^Length[s] / Times @@ s; Array[a, 36] (* Amiram Eldar, May 02 2020 *)
PROG
(Magma) [&*[ LCM([&+Divisors(d): d in Divisors(n)]) / &+Divisors(d): d in Divisors(n)]: n in [1..100]]
(PARI) a(n) = {my(d=divisors(n), lcms = lcm(vector(#d, k, sigma(d[k])))); vecprod(vector(#d, k, lcms/sigma(d[k]))); } \\ Michel Marcus, May 02 2020
CROSSREFS
Cf. Similar sequence with tau(d): A334470.
Sequence in context: A069970 A305169 A316759 * A153063 A165499 A094396
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, May 01 2020
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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)