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!)
A324528 a(n) = lcm(tau(n), pod(n)) where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955). 6
1, 2, 6, 24, 10, 36, 14, 64, 27, 100, 22, 1728, 26, 196, 900, 5120, 34, 5832, 38, 24000, 1764, 484, 46, 331776, 375, 676, 2916, 65856, 58, 810000, 62, 98304, 4356, 1156, 4900, 10077696, 74, 1444, 6084, 2560000, 82, 3111696, 86, 255552, 182250, 2116, 94 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = pod(n) for numbers n in A120736.
a(n) = tau(n) * pod(n) for numbers n in A046642.
EXAMPLE
For n=4: a(4) = lcm(tau(4), pod(4)) = lcm(3, 8) = 24.
MATHEMATICA
Table[LCM[DivisorSigma[0, n], Times@@Divisors[n]], {n, 50}] (* Harvey P. Dale, Aug 14 2019 *)
PROG
(Magma) [LCM(NumberOfDivisors(n), &*[d: d in Divisors(n)]): n in [1.. 100]]
(PARI) a(n) = my(d=divisors(n)); lcm(vecprod(d), #d); \\ Michel Marcus, Mar 05 2019
CROSSREFS
Sequence in context: A323615 A204934 A033642 * A334795 A370252 A181952
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)