|
%I #13 Dec 27 2013 11:36:44
%S 1,2,3,5,7,11,12,13,15,17,19,23,29,31,33,35,37,41,43,47,48,51,53,56,
%T 59,61,65,67,69,71,73,77,79,80,83,85,87,89,91,95,97,101,103,107,109,
%U 113,115,119,123,127,131,133,137,139,141,143,145,149,151,157,159
%N Numbers n such that phi(n)^phi(n) == gcd(n, phi(n)) (mod n), where phi is the Euler totient function.
%C It contains the sequence A003277 (cyclic numbers).
%H Charles R Greathouse IV, <a href="/A230918/b230918.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Range[300], PowerMod[EulerPhi[#], EulerPhi[#], #] == GCD[#,
%t EulerPhi[#]] &]
%o (PARI) is(n)=my(p=eulerphi(n),g=gcd(p,n)); Mod(p,n)^p==g \\ _Charles R Greathouse IV_, Dec 27 2013
%Y Cf. A003277, A230919.
%K nonn
%O 1,2
%A _José María Grau Ribas_, Nov 01 2013
|
