OFFSET
0,7
COMMENTS
LINKS
MATHEMATICA
a[n_] := Max[0, Max[Select[FactorInteger[n!][[;; , 2]], EvenQ]]]; Array[a, 100, 0]
PROG
(PARI) a(n) = {my(e = select(x -> !(x % 2), factor(n!)[, 2])); if(#e == 0, 0, vecmax(e)); }
(Python)
from collections import Counter
from sympy import factorint
def A375850(n): return max(filter(lambda x: x&1^1, sum((Counter(factorint(i)) for i in range(2, n+1)), start=Counter()).values()), default=0) # Chai Wah Wu, Aug 31 2024
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Aug 31 2024
STATUS
approved