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 A375848 #9 Aug 31 2024 15:16:28
%S A375848 0,3,3,3,5,3,3,3,6,3,3,5,3,3,3,3,3,3,3,5,3,3,3,6,3,3,5,3,5,3,3,3,3,3,
%T A375848 5,3,3,3,6,3,3,3,3,5,3,3,3,3,3,3,5,3,3,6,3,3,3,5,5,3,3,3,9,3,3,3,3,5,
%U A375848 3,3,6,3,3,3,5,3,3,3,3,5,3,3,3,3,3,6,3,3,6,5,3,3,3,3,3,3,3,5,3,3,6,3,3,3,5
%N A375848 The maximum exponent in the prime factorization of the numbers whose maximum exponent in their prime factorization is an evil number (A374590).
%H A375848 Amiram Eldar, <a href="/A375848/b375848.txt">Table of n, a(n) for n = 1..10000</a>
%H A375848 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
%F A375848 a(n) = A051903(A374590(n)).
%F A375848 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k in A001969} (k * (1/zeta(k+1) - 1/zeta(k))) / d = 3.61461685523237846738..., where d = Sum_{k in A001969} (1/zeta(k+1) - 1/zeta(k)) = 0.12101890210392912747... is the asymptotic density of A374590.
%t A375848 evilQ[n_] := EvenQ[DigitCount[n, 2, 1]]; s[n_] := Module[{e = Max[FactorInteger[n][[;; , 2]]]}, If[evilQ[e], e, Nothing]]; s[1] = 0; Array[s, 1000]
%o A375848 (PARI) lista(kmax) = {my(e); print1(0, ", "); for(k = 2, kmax, e = vecmax(factor(k)[,2]); if(!(hammingweight(e) % 2), print1(e, ", ")));}
%Y A375848 Cf. A001969, A051903, A374590.
%K A375848 nonn,easy,base
%O A375848 1,2
%A A375848 _Amiram Eldar_, Aug 31 2024