|
%I #17 Apr 18 2023 08:29:50
%S 0,1,1,2,1,1,1,3,2,1,1,2,1,1,1,4,1,2,1,1,1,1,1,3,2,1,3,1,1,1,1,5,1,1,
%T 1,2,1,1,1,3,1,1,1,1,2,1,1,4,2,2,1,1,1,3,1,3,1,1,1,1,1,1,2,6,1,1,1,1,
%U 1,1,1,2,1,1,2,1,1,1,1,4,4,1,1,1,1,1,1,1,1,2,1,1,1,1,1,5,1,2,1,2,1,1
%N Exponent of the largest prime power factor of n, a(1)=0.
%H Antti Karttunen, <a href="/A088388/b088388.txt">Table of n, a(n) for n = 1..65537</a>
%F A034699(n) = A088387(n)^a(n).
%t a[n_] := If[n==1, 0, MaximalBy[FactorInteger[n], #[[1]]^#[[2]]&][[1, 2]]];
%t Array[a, 100] (* _Jean-François Alcover_, Dec 03 2021 *)
%o (PARI) A088388(n) = if(1==n,0,my(f=factor(n)); isprimepower(vecmax(vector(#f[, 1], i, f[i, 1]^f[i, 2])))); \\ _Antti Karttunen_, Jul 22 2018
%o (Python)
%o from sympy import factorint
%o def A088388(n): return max(((p**e,e) for p, e in factorint(n).items()), default=(0,0))[1] # _Chai Wah Wu_, Apr 17 2023
%Y Cf. A034699, A088387.
%K nonn
%O 1,4
%A _Reinhard Zumkeller_, Sep 28 2003
|
