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 A052125 #13 Jul 02 2025 16:01:58
%S A052125 1,1,1,1,1,3,1,1,1,5,1,4,1,7,5,1,1,9,1,5,7,11,1,8,1,13,1,7,1,15,1,1,
%T A052125 11,17,7,9,1,19,13,8,1,21,1,11,9,23,1,16,1,25,17,13,1,27,11,8,19,29,1,
%U A052125 20,1,31,9,1,13,33,1,17,23,35,1,9,1,37,25,19,11,39,1,16,1,41,1,28,17,43
%N A052125 a(n) = n/A034684(n).
%C A052125 The largest aliquot unitary divisor of n, for n > 1. - _Amiram Eldar_, Nov 08 2020
%H A052125 Antti Karttunen, <a href="/A052125/b052125.txt">Table of n, a(n) for n = 1..65537</a>
%e A052125 Since A034684(6) = 2, the value of a(6) here is 6/2 = 3.
%t A052125 a[n_] := n / Min @ (Power @@@ FactorInteger[n]); Array[a, 100] (* _Amiram Eldar_, Nov 08 2020 *)
%o A052125 (PARI) A052125(n) = {local(f,m);if(n==1,1,f=factor(n);m=f[1,1]^f[1,2];for(i=1,matsize(f)[1],m=min(m,f[i,1]^f[i,2]));n/m)}; \\ _Michael B. Porter_, Jan 28 2010
%Y A052125 Cf. A034684.
%K A052125 nonn
%O A052125 1,6
%A A052125 _James Sellers_, Jan 21 2000