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 A068211 #26 Sep 08 2022 08:45:05
%S A068211 2,2,2,2,3,2,3,2,5,2,3,3,2,2,2,3,3,2,3,5,11,2,5,3,3,3,7,2,5,2,5,2,3,3,
%T A068211 3,3,3,2,5,3,7,5,3,11,23,2,7,5,2,3,13,3,5,3,3,7,29,2,5,5,3,2,3,5,11,2,
%U A068211 11,3,7,3,3,3,5,3,5,3,13,2,3,5,41,3,2,7,7,5,11,3,3,11,5,23,3,2,3,7,5,5
%N A068211 Largest prime factor of Euler totient function phi(n).
%C A068211 Smallest numbers m, such that largest prime factor of phi(m) is prime(n), a(n) is a prime number and identical to the n-th term of A035095: min{x: A068211(x) = prime(n)} = A035095(n). E.g., phi(A035095(7)) = phi(103) = 2*3*17 of which 17 = prime(7) is the largest prime factor.
%H A068211 T. D. Noe, <a href="/A068211/b068211.txt">Table of n, a(n) for n = 3..1000</a>
%F A068211 a(n) = A006530(A000010(n)).
%e A068211 For n=46, phi(46) = 2*2*11, hence a(46) = 11.
%t A068211 Table[FactorInteger[EulerPhi[n]][[-1, 1]], {n, 3, 100}] (* _Vincenzo Librandi_, Jan 04 2017 *)
%o A068211 (Magma) [Maximum(PrimeDivisors(EulerPhi(n))): n in [3..90]]; // _Vincenzo Librandi_, Jan 04 2017
%o A068211 (PARI) a(n) = vecmax(factor(eulerphi(n))[,1]); \\ _Michel Marcus_, Jan 04 2017
%Y A068211 Cf. A000010, A006530.
%Y A068211 Cf. A035095, A035096.
%K A068211 nonn
%O A068211 3,1
%A A068211 _Labos Elemer_, Feb 21 2002