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 A372602 #9 May 08 2024 08:53:02
%S A372602 0,0,0,2,0,0,0,2,2,0,0,2,0,0,0,4,0,2,0,2,0,0,0,2,2,0,2,2,0,0,0,4,0,0,
%T A372602 0,2,0,0,0,2,0,0,0,2,2,0,0,4,2,2,0,2,0,2,0,2,0,0,0,2,0,0,2,6,0,0,0,2,
%U A372602 0,0,0,2,0,0,2,2,0,0,0,4,4,0,0,2,0,0,0
%N A372602 The maximal exponent in the prime factorization of the largest square dividing n.
%H A372602 Amiram Eldar, <a href="/A372602/b372602.txt">Table of n, a(n) for n = 1..10000</a>
%F A372602 a(n) = A051903(A008833(n)).
%F A372602 a(n) = A052928(A051903(n)).
%F A372602 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 2 * Sum_{i>=1} (1 - (1/zeta(2*i))) = 0.98112786070359477197... .
%t A372602 f[n_] := 2 * Floor[n/2]; a[n_] := f[Max[FactorInteger[n][[;; , 2]]]]; a[1] = 0; Array[a, 100]
%o A372602 (PARI) s(n) = n \ 2 * 2;
%o A372602 a(n) = if(n>1, s(vecmax(factor(n)[,2])), 0);
%Y A372602 Cf. A008833, A051903, A052928.
%Y A372602 Similar sequences: A007424, A368781, A372601, A372603, A372604.
%K A372602 nonn,easy
%O A372602 1,4
%A A372602 _Amiram Eldar_, May 07 2024