|
%I #9 Jul 23 2018 02:49:55
%S 2,12,120,126,240,2,3276,8160,1026,3300,2,32760,2,2,16320,531468,
%T 270600,4214,12,2,65520,2,2,12,2,5241852,32640,2,2,5043631320,2,
%U 541200,2,25284,245640,12,216084960,25250,2,12,2,4697028,2,393240,12,3407203800,2,65280,2,388332
%N For successive terms of A002202, totient values t, lcm({x: phi(x)=t})/gcd({x: phi(x)=t}).
%C From _Torlach Rush_, Jul 03 2018: (Start)
%C Consider the quotients q(t) = lcm({x: phi(x)=t})/gcd({x: phi(x)=t}).
%C When the number of solutions is 2, q(t) must be 2. For example invphi(10) = [11, 22], and q(10)=2.
%C When the number of solutions is 3, the solutions are x1 < x2 < (2 * x1) and the only observed value of q(t) is 12. For example, invphi(44) = [69, 92, 138], and q(44)=12.
%C When the number of solutions is greater than 3, multiple values of q(t) are observed. (End)
%H Max Alekseyev, <a href="http://home.gwu.edu/~maxal/gpscripts/">PARI scripts for various problems</a>
%e invphi(1) = [1, 2] and lcm(1, 2) / gcd(1, 2) is 2.
%t Map[LCM[##]/GCD[##] & @@ # &, Take[Values@ KeySort@ PositionIndex@ Array[EulerPhi, 10^6], 50]] (* _Michael De Vlieger_, Jul 20 2018 *)
%o (PARI) lista(nn) = {for (n=1, nn, my(v = invphi(n)); if (#v, print1(lcm(v)/gcd(v), ", ")););}
%Y Cf. A000010, A002202, A032447.
%K nonn
%O 1,1
%A _Michel Marcus_, Jul 19 2018
|
