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 A368713 #8 Jan 04 2024 07:25:21
%S A368713 2,3,2,2,4,2,2,3,2,3,2,5,2,3,2,2,4,2,2,2,3,3,2,2,6,2,3,2,2,4,4,2,3,2,
%T A368713 2,5,2,2,2,3,3,4,2,2,3,2,2,3,2,7,2,3,3,2,4,2,2,2,3,2,2,5,4,2,3,2,2,2,
%U A368713 2,4,2,3,2,3,6,2,2,3,2,2,4,2,3,2,5,2,2,3,2,2,4
%N A368713 The maximal exponent in the prime factorization of the nonsquarefree numbers.
%C A368713 The terms of A051903 that are larger than 1.
%H A368713 Amiram Eldar, <a href="/A368713/b368713.txt">Table of n, a(n) for n = 1..10000</a>
%F A368713 a(n) = A051903(A013929(n)).
%F A368713 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = (c * zeta(2) - 1)/(zeta(2) - 1) = 2.798673520766..., where c = 1.705211... is Niven's constant (A033150).
%t A368713 s[n_] := Max @@ Last /@ FactorInteger[n]; s /@ Select[Range[250], !SquareFreeQ[#] &]
%t A368713 (* or *)
%t A368713 f[n_] := Module[{e = Max @@ FactorInteger[n][[;; , 2]]}, If[e > 1, e, Nothing]]; Array[f, 250]
%o A368713 (PARI) lista(kmax) = {my(e); for(k = 2, kmax, e = vecmax(factor(k)[,2]); if(e > 1, print1(e, ", ")));}
%Y A368713 Cf. A013661, A013929, A033150, A051903.
%Y A368713 Similar sequences: A368710, A368711, A368712.
%K A368713 nonn,easy
%O A368713 1,1
%A A368713 _Amiram Eldar_, Jan 04 2024