|
%I #26 Jun 28 2019 04:26:06
%S 1,2465,314821,15841,658801,41041,21584305,8830801,8911,11205601,
%T 3193414093,1729,9653421961,1193229577,1232469001,69331969,1419339691,
%U 46657,587034735001,9439201,64774081,67047668161,100929219805,7995169,1894344001,212027401,67371265,3057601
%N Smallest number k such that gcd(phi(k), k-1) = n * lambda(k).
%C For n > 1, a(n) is a Carmichael number.
%C a(19) <= 587034735001. - _Giovanni Resta_, Mar 24 2017
%H Amiram Eldar, <a href="/A284089/b284089.txt">Table of n, a(n) for n = 1..138</a>
%t m=10; s=Table[0,{m}]; c=0; k=0; While[c<m, k++; If[IntegerQ[n = GCD[EulerPhi[k], k-1]/CarmichaelLambda[k]] && n<=m && s[[n]] == 0, c++; s[[n]]=k]]; s (* _Amiram Eldar_, Jun 26 2019 *)
%Y Cf. A000010, A002322, A002997, A049559, A264024.
%K nonn
%O 1,2
%A _Altug Alkan_ and _Thomas Ordowski_, Mar 24 2017
%E a(7)-a(18) from _Giovanni Resta_, Mar 24 2017
%E a(19)-a(28) from _Amiram Eldar_, Jun 26 2019
|
