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 A076397 #12 Feb 16 2025 08:32:47
%S A076397 1,2,2,3,2,5,3,2,3,7,2,3,5,11,5,2,3,13,7,3,5,3,2,17,3,7,19,5,7,11,2,
%T A076397 23,3,5,13,3,7,29,5,31,5,2,11,17,7,3,11,37,19,13,5,41,3,7,43,11,5,2,
%U A076397 23,3,13,47,3,7,5,17,13,7,53,3,11,5,7,19,29,5,59,5,61,31,7,2,13,11,67,17,23
%N A076397 Largest prime factor of n-th perfect power.
%C A076397 a(n) = A006530(A001597(n)).
%H A076397 Reinhard Zumkeller, <a href="/A076397/b076397.txt">Table of n, a(n) for n = 1..10000</a>
%H A076397 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PerfectPower.html">Perfect Powers</a>.
%H A076397 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GreatestPrimeFactor.html">Greatest Prime Factor</a>.
%F A076397 a(n) = A006530(A025478(n)).
%t A076397 perfPQ[n_]:=GCD@@FactorInteger[n][[All,2]]>1; Join[ {1},FactorInteger[ #][[-1,1]]&/@ Select[Range[5000],perfPQ]] (* _Harvey P. Dale_, Sep 12 2021 *)
%o A076397 (Haskell)
%o A076397 a076397 = a006530 . a025478 -- _Reinhard Zumkeller_, Mar 28 2014
%Y A076397 Cf. A025478, A076396, A076403.
%K A076397 nonn
%O A076397 1,2
%A A076397 _Reinhard Zumkeller_, Oct 09 2002