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 A062325 #19 Jun 29 2018 20:20:03
%S A062325 1,3,7,12,26,45,55,79,106,123,211,252,422,446,595,723,907,1019,1101,
%T A062325 1448,1595,1687,1797,1849,1949,2058,2393,2516,2703,2819,3146,3339,
%U A062325 3477,3626,4353,4437,4590,5153,5398,5653,5836,6276,6543,6736,6911,7207,7695
%N A062325 Numbers k for which phi(prime(k)) is a square.
%C A062325 Also A002496 indexed by A000040.
%H A062325 Harry J. Smith, <a href="/A062325/b062325.txt">Table of n, a(n) for n = 1..1000</a>
%F A062325 a(n) = A000720(A002496(n)).
%F A062325 A000040(a(n)) = A002496(n).
%e A062325 79 is in the sequence because the 79th prime is 401 and phi(401) is 400 = 20^2.
%e A062325 595 is in the sequence because the 595th prime is 4357 and phi(4357) is 4356 = 66^2.
%t A062325 Flatten[Position[Table[IntegerQ[Sqrt[Prime[w]-1]], {w, 1, 25000}], True]]
%t A062325 Flatten[Position[EulerPhi[Prime[Range[8000]]],_?(IntegerQ[Sqrt[#]]&)]] (* _Harvey P. Dale_, Apr 23 2014 *)
%o A062325 (PARI) for(n=1,1600, if(issquare(eulerphi(prime(n))),print(n)))
%o A062325 (PARI) { default(primelimit, 2*10^8); n=m=0; forprime (p=2, 2*10^8, m++; if (issquare(eulerphi(p)), write("b062325.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 05 2009
%Y A062325 Cf. A000040, A000720, A001912, A002496, A005574, A062325, A090693.
%K A062325 easy,nonn
%O A062325 1,2
%A A062325 _Jason Earls_, Jul 05 2001
%E A062325 More terms from _Labos Elemer_, Jul 09 2001