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.
%I A067583 #10 Dec 19 2021 17:51:03
%S A067583 1,2,8,243,128,177147,32768,129140163,94143178827,2147483648,
%T A067583 50031545098999707,26588814358957503287787,19383245667680019896796723,
%U A067583 9223372036854775808,7509466514979724803946715958257547
%N A067583 Integers of the form phi(n^n)/phi(n)^n where phi is the Euler totient function A000010(n).
%F A067583 If A007694(n)==0 (mod 3) (or equivalently if A007694(n) = 2^u*3^v with u, v >=1) then a(n) =3^(A007694(n) -1); if A007694(n)=2^u a(n)=2^(A007694(n) -1). Remark : if n=3^v phi(n^n)/phi(n)^n=1/2^(n-1)
%t A067583 Select[Table[EulerPhi[n^n]/EulerPhi[n]^n,{n,100}],IntegerQ] (* _Harvey P. Dale_, Dec 19 2021 *)
%K A067583 nonn
%O A067583 1,2
%A A067583 _Benoit Cloitre_, Jan 30 2002