cp's OEIS Frontend

A336715 Numbers m that divide the product phi(m) * tau(m), where tau is the number of divisors function (A000005) and phi is the Euler totient function (A000010).

%I A336715 #21 Aug 05 2020 10:19:34
%S A336715 1,2,8,9,12,18,32,36,72,80,96,108,128,144,243,288,324,400,448,486,512,
%T A336715 576,625,720,768,864,972,1152,1200,1250,1344,1620,1944,2000,2025,2048,
%U A336715 2304,2500,2560,2592,2916,3136,3600,3888,4032,4050,4608,5000,5103,5625,6144,6561,6912
%N A336715 Numbers m that divide the product phi(m) * tau(m), where tau is the number of divisors function (A000005) and phi is the Euler totient function (A000010).
%C A336715 Numbers of the form q = 2^(2k+1) with k>=0 (A004171) form a subsequence because tau(q) * phi(q) / q = k + 1.
%C A336715 Numbers of the form q = 9 * 2^k with k>=0 (A005010) form another subsequence because tau(q) * phi(q) / q = k+1 (also).
%H A336715 David A. Corneth, <a href="/A336715/b336715.txt">Table of n, a(n) for n = 1..12173</a> (terms <= 10^15)
%e A336715 For 80, phi(80) = 32, tau(80) = 10 and tau(80)*phi(80)/80 = 4, hence 80 is a term.
%p A336715 with(numtheory):
%p A336715 filter:= m-> irem(phi(m)*tau(m), m)=0:
%p A336715 select(filter, [$1..7000])[];
%t A336715 Select[Range[7000], Divisible[DivisorSigma[0, #] * EulerPhi[#], #] &] (* _Amiram Eldar_, Aug 01 2020 *)
%o A336715 (PARI) isok(m) = (eulerphi(m)*numdiv(m) % m) == 0; \\ _Michel Marcus_, Aug 02 2020
%Y A336715 Cf. A000010 (phi), A000005 (tau), A062355.
%Y A336715 Subsequences: A004171, A005010.
%K A336715 nonn
%O A336715 1,2
%A A336715 _Bernard Schott_, Aug 01 2020