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 A088865 #14 Apr 25 2017 19:00:32
%S A088865 1,2,3,4,5,25,7,8,9,49,11,125,13,81,64,16,17,125,19,343,100,169,23,
%T A088865 625,25,225,27,729,29,1000,31,32,196,361,144,625,37,441,256,2401,41,
%U A088865 1728,43,2197,512,625,47,3125,49,343,400,3375,53,625,256,6561,484,961
%N A088865 (Sum of distinct prime factors)^(sum of prime exponents).
%C A088865 a(n) = n iff n is 1 or a prime power; otherwise, a(n) > n. - _Ivan Neretin_, May 31 2016
%H A088865 Ivan Neretin, <a href="/A088865/b088865.txt">Table of n, a(n) for n = 1..10000</a>
%F A088865 a(n) = A008472(n)^A001222(n).
%e A088865 a(75) = a(3^1 * 5^2) = (3+5)^(1+2) = 8^3 = 512.
%t A088865 pf2pe[n_]:=Module[{tfi=Transpose[FactorInteger[n]]},Total[ First[tfi]]^ Total[ Last[tfi]]]; Array[pf2pe,60] (* _Harvey P. Dale_, Sep 21 2011 *)
%t A088865 Array[Power @@ Map[Total, Transpose@ FactorInteger@ #] &, 58] (* _Michael De Vlieger_, Apr 25 2017 *)
%K A088865 nonn
%O A088865 1,2
%A A088865 _Reinhard Zumkeller_, Nov 26 2003