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-1 of 1 results.

A328651 Composite k for which lcm(k, phi(k)) + lcm(k, tau(k)) = lcm(k, sigma(k)).

Original entry on oeis.org

135, 546, 672, 9585, 24570, 51510, 63855, 190008, 251370, 323730, 372438, 486180, 510570, 723550, 819000, 1058910, 1282365, 1284192, 1356030, 3506390, 5416200, 5604480, 6298625, 15593760, 17813250, 18009000, 20740590, 26759370, 27027000, 27081000, 29795040
Offset: 1

Views

Author

Marius A. Burtea, Oct 23 2019

Keywords

Comments

Composite numbers k verifying equation A009230(k) + A009262(k) = A009242(k).
For any prime number p >= 3 the equality lcm(k, phi(k)) + lcm(k, tau(k)) = lcm(k, sigma(k)) is satisfied.
The sequence terms are the composite numbers for which the equality is true.

Examples

			For k = 135 = 3^3 * 5, tau(k) = 4 * 2 = 2^3, phi(k) = 2 * 3^2 * 4 = 2^3 * 3^2 , sigma(k) = 2^4 * 3 * 5, lcm(k, tau(k)) + lcm(k, phi(k)) =  2^3 * 3^3 * 5 + 2^3 * 3^3 * 5 = 2^4 * 3^3 * 5 and lcm(k, sigma(k)) = lcm(3^3 * 5, 2^4 * 3 * 5) = 2^4 * 3^3 * 5.
		

Crossrefs

Programs

  • Magma
    [k: k in [1..6000000]| not IsPrime(k) and Lcm(k,NumberOfDivisors(k))+Lcm(k,EulerPhi(k)) eq Lcm(k,SumOfDivisors(k))];
    
  • Mathematica
    aQ[n_] := CompositeQ[n] && LCM[n, EulerPhi[n]] + LCM[n, DivisorSigma[0, n]] == LCM[n, DivisorSigma[1, n]]; Select[Range[3*10^6], aQ] (* Amiram Eldar, Oct 23 2019 *)
  • PARI
    isok(k) = !isprime(k) && (lcm(k, numdiv(k)) + lcm(k, eulerphi(k)) == lcm(k, sigma(k))); \\ Michel Marcus, Oct 24 2019
Showing 1-1 of 1 results.