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 A275465 #35 Aug 12 2021 17:53:34
%S A275465 2,3,4,5,8,7,16,27,32,11,64,13,128,243,256,17,512,19,1024,2187,2048,
%T A275465 23,4096,3125,8192,19683,16384,29,32768,31,65536,177147,131072,78125,
%U A275465 262144,37,524288,1594323,1048576,41,2097152,43,4194304,14348907,8388608,47,16777216
%N A275465 a(n) = f^(n/f), where f is the smallest prime factor of n.
%H A275465 Chai Wah Wu, <a href="/A275465/b275465.txt">Table of n, a(n) for n = 2..1000</a>
%F A275465 a(p) = p, a(p^2) = p^p and a(p^m) = p^(p^(m-1)) for prime p. - _Chai Wah Wu_, Jul 29 2016
%F A275465 a(n) = A020639(n)^(n/A020639(n)). - _Felix Fröhlich_, Jul 30 2016
%F A275465 a(n) = A020639(n)^A032742(n). - _Chai Wah Wu_, Jul 30 2016
%e A275465 For n = 12 = 2^2*3, the smallest prime factor of n is f = 2, so a(12) = f^(n/f) = 2^(12/2) = 2^6 = 64. - _Michael B. Porter_, Jul 31 2016
%p A275465 a:= n-> (f-> f^(n/f))(min(numtheory[factorset](n))):
%p A275465 seq(a(n), n=2..50); # _Alois P. Heinz_, Dec 11 2017
%t A275465 a[n_] := With[{f = FactorInteger[n][[1, 1]]}, f^(n/f)]; ; Array[a,50,2] (* _JungHwan Min_, Jul 29 2016 *)(* amended by _Harvey P. Dale_, Aug 12 2021 *)
%o A275465 (Python)
%o A275465 from __future__ import division
%o A275465 from sympy import primefactors
%o A275465 def A275465(n):
%o A275465 p = min(primefactors(n))
%o A275465 return p**(n//p) # _Chai Wah Wu_, Jul 29 2016
%o A275465 (PARI) a(n) = my(f=factor(n)[1, 1]); f^(n/f) \\ _Felix Fröhlich_, Jul 30 2016
%Y A275465 Cf. A020639, A032742.
%K A275465 nonn,easy
%O A275465 2,1
%A A275465 _Tyler Skywalker_, Jul 28 2016
%E A275465 More terms from _Chai Wah Wu_, Jul 30 2016