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 A112538 #14 Nov 06 2017 02:41:53
%S A112538 1,1,4,1,1,1,9,8,1,1,1,1,1,1,16,1,1,1,1,1,1,1,1,32,1,27,1,1,1,1,25,1,
%T A112538 1,1,64,1,1,1,1,1,1,1,1,1,1,1,1,128,1,1,1,1,1,1,1,1,1,1,1,1,1,1,36,1,
%U A112538 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,64,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1024
%N A112538 If b(n) is the smallest positive integer and c(n) is the largest positive integer such that n = b(n)^c(n), then a(n) = c(n)^b(n).
%H A112538 Michael De Vlieger, <a href="/A112538/b112538.txt">Table of n, a(n) for n = 2..10000</a>
%H A112538 G. Kreweras, <a href="/A001844/a001844.pdf">Sur les hiérarchies de segments</a>, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #20 (1973). (Annotated scanned copy)
%F A112538 a(n) = A052409(n)^A052410(n).
%e A112538 25 = 5^2, so a(25) = 2^5 = 32.
%t A112538 Array[#2^If[#1 == 1, 1, #1^(1/#2)] & @@ {#, Apply[GCD, FactorInteger[#][[All, -1]]]} &, 99, 2] (* _Michael De Vlieger_, Nov 05 2017, after _Ray Chandler_ at A052409 *)
%Y A112538 Cf. A052409, A052410.
%K A112538 nonn
%O A112538 2,3
%A A112538 _Leroy Quet_, Dec 14 2005
%E A112538 Extended by _Ray Chandler_, Dec 25 2005