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 A232098 #26 Aug 11 2024 17:18:37
%S A232098 1,2,1,2,1,3,1,2,1,2,1,4,1,2,1,2,1,3,1,2,1,2,1,4,1,2,1,2,1,3,1,2,1,2,
%T A232098 1,4,1,2,1,2,1,3,1,2,1,2,1,4,1,2,1,2,1,3,1,2,1,2,1,6,1,2,1,2,1,3,1,2,
%U A232098 1,2,1,4,1,2,1,2,1,3,1,2,1,2,1,4,1,2,1
%N A232098 a(n) is the largest m such that m! divides n^2; a(n) = A055881(n^2).
%C A232098 For all n, A055881(n) <= a(n), and probably also a(n) <= A055874(n).
%C A232098 Moreover, a(n) > A055881(n) if and only if A055874(n) > A055881(n), thus A055926 gives (also) all the positions where this sequence differs from A055881. Please see Comments section in A055926 for the proof.
%C A232098 Differs from A055874 for the first time at n=840, where a(840)=7, while A055874(840)=8. A232099 gives all the positions where such differences occur.
%H A232098 Antti Karttunen, <a href="/A232098/b232098.txt">Table of n, a(n) for n = 1..10080</a>
%F A232098 a(n) = A055881(A000290(n)) = A055881(n^2).
%F A232098 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{k>=1} 1/A065887(k) = 1.78672776922161809767... . - _Amiram Eldar_, Jan 01 2024
%t A232098 Module[{nn=10,fct},fct=Table[{f,f!},{f,nn}];Table[Select[fct,Mod[n^2,#[[2]]]==0&][[-1,1]],{n,90}]] (* _Harvey P. Dale_, Aug 11 2024 *)
%o A232098 (Scheme)
%o A232098 (define (A232098 n) (A055881 (A000290 n)))
%Y A232098 Cf. A055881, A055874, A055926, A065887, A232096, A232099, A233267.
%K A232098 nonn
%O A232098 1,2
%A A232098 _Antti Karttunen_, Nov 18 2013