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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A338563 a(n) = lcm(n, tau(n), sigma(n)) where tau(k) is the number of divisors of k (A000005) and sigma(k) is the sum of divisors of k (A000203). 0
 1, 6, 12, 84, 30, 12, 56, 120, 117, 180, 132, 84, 182, 168, 120, 2480, 306, 234, 380, 420, 672, 396, 552, 120, 2325, 1092, 1080, 168, 870, 360, 992, 2016, 528, 1836, 1680, 3276, 1406, 1140, 2184, 360, 1722, 672, 1892, 924, 1170, 1656, 2256, 7440, 2793, 4650 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(p) = p *(p + 1) for p = primes (A000040). EXAMPLE a(6) = lcm(6, tau(6), sigma(6)) = lcm(6, 4, 12) = 12. MATHEMATICA a[n_] := LCM @@ {n, DivisorSigma[0, n], DivisorSigma[1, n]}; Array[a, 50] (* Amiram Eldar, Nov 03 2020 *) PROG (MAGMA) [LCM([n, #Divisors(n), &+Divisors(n)]): n in [1..100]] (PARI) a(n) = my(f=factor(n)); lcm([n, sigma(f), numdiv(f)]); \\ Michel Marcus, Nov 03 2020 CROSSREFS Cf. A000005, A000203. Cf. A337323 (gcd(n, tau(n), sigma(n))), A324528 (lcm(n, tau(n), pod(n))), A324529 (lcm(n, sigma(n), pod(n))). Sequence in context: A305058 A220232 A196253 * A345271 A054883 A005402 Adjacent sequences:  A338560 A338561 A338562 * A338564 A338565 A338566 KEYWORD nonn AUTHOR Jaroslav Krizek, Nov 02 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 05:05 EST 2021. Contains 349445 sequences. (Running on oeis4.)