|
|
A088388
|
|
Exponent of the largest prime power factor of n, a(1)=0.
|
|
5
|
|
|
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, 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, 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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := If[n==1, 0, MaximalBy[FactorInteger[n], #[[1]]^#[[2]]&][[1, 2]]];
|
|
PROG
|
(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
(Python)
from sympy import factorint
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|