The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307892 a(n) = lcm(tau(n), pod(n)) / n, where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955). 0
 1, 1, 2, 6, 2, 6, 2, 8, 3, 10, 2, 144, 2, 14, 60, 320, 2, 324, 2, 1200, 84, 22, 2, 13824, 15, 26, 108, 2352, 2, 27000, 2, 3072, 132, 34, 140, 279936, 2, 38, 156, 64000, 2, 74088, 2, 5808, 4050, 46, 2, 26542080, 21, 7500, 204, 8112, 2, 157464, 220, 175616, 228 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS n divides lcm(tau(n), pod(n)) for all n >= 1. LINKS Table of n, a(n) for n=1..57. FORMULA a(n) = A324528(n) / n. EXAMPLE For n=4: a(4) = lcm(tau(4), pod(4))/4 = lcm(3, 8)/4 = 24/4 = 6. PROG (Magma) [LCM(NumberOfDivisors(n), &*[d: d in Divisors(n)]) / n: n in [1.. 10^5]] CROSSREFS Cf. A000005, A007955, A324528. Sequence in context: A021796 A127356 A232273 * A276152 A270360 A163904 Adjacent sequences: A307889 A307890 A307891 * A307893 A307894 A307895 KEYWORD nonn AUTHOR Jaroslav Krizek, May 03 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.

Last modified July 21 16:28 EDT 2024. Contains 374475 sequences. (Running on oeis4.)