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 A368925 #11 Feb 16 2024 02:12:20
%S A368925 0,2,3,2,4,2,3,5,2,2,6,2,4,2,2,2,3,7,2,2,2,2,3,2,5,8,2,2,2,3,2,2,2,3,
%T A368925 2,2,2,9,2,2,4,3,2,2,6,2,2,2,3,2,2,2,2,3,10,2,2,2,2,2,4,2,3,2,2,2,2,2,
%U A368925 2,2,2,3,2,2,2,2,3,3,2,11,2,7,3,2,2,2,4
%N A368925 The minimal exponent in the prime factorization of the powerful numbers.
%H A368925 Amiram Eldar, <a href="/A368925/b368925.txt">Table of n, a(n) for n = 1..10000</a>
%F A368925 a(n) = A051904(A001694(n)).
%F A368925 a(n) >= 2 for n >= 2.
%F A368925 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2.
%t A368925 s[n_] := If[n == 1, 0, Min @@ Last /@ FactorInteger[n]]; s /@ Select[Range[3000], # == 1 || Min[FactorInteger[#][[;;, 2]]] > 1 &]
%t A368925 (* or *)
%t A368925 f[n_] := Module[{e = Min[FactorInteger[n][[;; , 2]]]}, If[n == 1, 0, If[e > 1, e, Nothing]]]; Array[f, 3000]
%o A368925 (PARI) lista(kmax) = {my(e); for(k = 1, kmax, if(k == 1, print1(0, ", "), e = vecmin(factor(k)[,2]); if(e > 1, print1(e, ", "))));}
%Y A368925 Cf. A001694, A051904, A368710.
%K A368925 nonn,easy
%O A368925 1,2
%A A368925 _Amiram Eldar_, Feb 15 2024