cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A336723 a(n) = lcm(tau(n), sigma(n), pod(n)) where tau(k) is the number of divisors of k (A000005), sigma(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955).

Original entry on oeis.org

1, 6, 12, 168, 30, 36, 56, 960, 351, 900, 132, 12096, 182, 1176, 1800, 158720, 306, 75816, 380, 168000, 14112, 4356, 552, 1658880, 11625, 14196, 29160, 65856, 870, 810000, 992, 2064384, 17424, 31212, 58800, 917070336, 1406, 21660, 85176, 23040000, 1722, 6223392
Offset: 1

Views

Author

Jaroslav Krizek, Aug 01 2020

Keywords

Comments

a(n) = pod(n) for numbers n: 1, 6, 30, 66, 84, 102, 120, 210, 270, 318, 330, 420, 462, 510, 546, 570, 642, ...

Examples

			a(6) = lcm(tau(6), sigma(6), pod(6)) = lcm(4, 12, 36) = 36.

Crossrefs

Cf. A009278 (lcm(tau(n), sigma(n))), A324528 (lcm(tau(n), pod(n))), A324529 (lcm(sigma(n), pod(n))).
Cf. A000005 (tau(n)), A000203 (sigma(n)), A007955 (pod(n)), A336722 (gcd(tau(n), sigma(n), pod(n))).
Cf. A277521 (numbers k such that a(k) = pod(k) and simultaneously A336722(k) = tau(k)).

Programs

  • Magma
    [LCM([#Divisors(n), &+Divisors(n), &*Divisors(n)]): n in [1..100]];
  • Mathematica
    a[n_] := LCM @@ {(d = DivisorSigma[0,n]), DivisorSigma[1, n], n^(d/2)}; Array[a, 50] (* Amiram Eldar, Aug 01 2020 *)
  • PARI
    a(n) = my(d=divisors(n)); lcm([#d, vecsum(d), vecprod(d)]); \\ Michel Marcus, Aug 12 2020

Formula

a(p) = p^2 + p for p = primes (A000040).

A334794 a(n) = Sum_{d|n} lcm(sigma(d), pod(d)) where sigma(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955).

Original entry on oeis.org

1, 7, 13, 63, 31, 55, 57, 1023, 364, 937, 133, 12207, 183, 1239, 1843, 32767, 307, 76222, 381, 168993, 14181, 4495, 553, 1672047, 3906, 14385, 29524, 23247, 871, 812785, 993, 2097151, 17569, 31525, 58887, 917158710, 1407, 22047, 85371, 23209953, 1723, 6238791
Offset: 1

Views

Author

Jaroslav Krizek, May 12 2020

Keywords

Examples

			a(6) = lcm(sigma(1), pod(1)) + lcm(sigma(2), pod(2)) + lcm(sigma(3), pod(3)) + lcm(sigma(6), pod(6)) = lcm(1, 1) + lcm(3, 2) + lcm(4, 3) + lcm(12, 36) = 1 + 6 + 12 + 36 = 55.

Crossrefs

Cf. A334663 (Sum_{d|n} gcd(sigma(d), pod(d))), A334793 (Sum_{d|n} lcm(tau(d), pod(d))).
Cf. A000203 (sigma(n)), A007955 (pod(n)), A324529 (lcm(sigma(n), pod(n))).

Programs

  • Magma
    [&+[LCM(&+Divisors(d), &*Divisors(d)): d in Divisors(n)]: n in [1..100]]
  • Mathematica
    a[n_] := DivisorSum[n, LCM[DivisorSigma[1, #], #^(DivisorSigma[0, #]/2)] &]; Array[a, 100] (* Amiram Eldar, May 12 2020 *)
  • PARI
    a(n) = sumdiv(n, d, lcm(sigma(d), vecprod(divisors(d)))); \\ Michel Marcus, May 12 2020

Formula

a(p) = p^2 + p + 1 for p = primes (A000040).

A307893 a(n) = lcm(sigma(n), pod(n)) / n, where sigma (k) = the sum of divisors of k (A000203) and pod(n) = the product of divisors of k (A007955).

Original entry on oeis.org

1, 3, 4, 14, 6, 6, 8, 120, 39, 90, 12, 1008, 14, 84, 120, 1984, 18, 4212, 20, 8400, 672, 198, 24, 69120, 155, 546, 1080, 784, 30, 27000, 32, 64512, 528, 918, 1680, 25474176, 38, 570, 2184, 576000, 42, 148176, 44, 40656, 52650, 828, 48, 164560896, 399, 232500
Offset: 1

Views

Author

Jaroslav Krizek, May 03 2019

Keywords

Comments

n divides lcm(sigma(n), pod(n)) for all n >= 1.

Examples

			For n=4: a(4) = lcm(sigma(4), pod(4))/4 = lcm(7, 8)/4 = 56/4 = 14.

Crossrefs

Cf. A000203, A007955, A324529.

Programs

  • Magma
    [LCM(SumOfDivisors(n), &*[d: d in Divisors(n)]) / n: n in [1.. 10^5]]
  • Mathematica
    Table[LCM[DivisorSigma[1,n],Times@@Divisors[n]]/n,{n,60}] (* Harvey P. Dale, May 29 2024 *)

Formula

a(n) = A324529(n) / n.

A334809 a(n) = Product_{d|n} lcm(sigma(d), pod(d)) where sigma(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955).

Original entry on oeis.org

1, 6, 12, 336, 30, 2592, 56, 322560, 4212, 162000, 132, 1755758592, 182, 395136, 648000, 10239344640, 306, 68976790272, 380, 1524096000000, 9483264, 3449952, 552, 2796089100573081600, 116250, 15502032, 122821920, 485745426432, 870, 102036672000000000, 992
Offset: 1

Views

Author

Jaroslav Krizek, Aug 01 2020

Keywords

Examples

			a(6) = lcm(sigma(1), pod(1)) * lcm(sigma(2), pod(2)) * lcm(sigma(3), pod(3)) * lcm(sigma(6), pod(6)) = lcm(1, 1) * lcm(3, 2) * lcm(4, 3) * lcm(12, 36) = 1 * 6 * 12 * 36 = 2592.

Crossrefs

Cf. A334794 (Sum_{d|n} lcm(sigma(d), pod(d))), A334731 (Product_{d|n} gcd(sigma(d), pod(d))).
Cf. A000203(sigma(n)), A007955 (pod(n)), A324529 (lcm(sigma(n), pod(n))).

Programs

  • Magma
    [&*[LCM(&+Divisors(d), &*Divisors(d)): d in Divisors(n)]: n in [1..100]]

Formula

a(p) = p^2 + p for p = primes (A000040).

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).

Original entry on oeis.org

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
Offset: 1

Views

Author

Jaroslav Krizek, Nov 02 2020

Keywords

Examples

			a(6) = lcm(6, tau(6), sigma(6)) = lcm(6, 4, 12) = 12.

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))).

Programs

  • Magma
    [LCM([n, #Divisors(n), &+Divisors(n)]): n in [1..100]]
  • Mathematica
    a[n_] := LCM @@ {n, DivisorSigma[0, n], DivisorSigma[1, n]}; Array[a, 50] (* Amiram Eldar, Nov 03 2020 *)
  • PARI
    a(n) = my(f=factor(n)); lcm([n, sigma(f), numdiv(f)]); \\ Michel Marcus, Nov 03 2020

Formula

a(p) = p *(p + 1) for p = primes (A000040).
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.