cp's OEIS Frontend

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.

A232098 a(n) is the largest m such that m! divides n^2; a(n) = A055881(n^2).

Original entry on oeis.org

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, 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, 1, 2, 1, 4, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1
Offset: 1

Views

Author

Antti Karttunen, Nov 18 2013

Keywords

Comments

For all n, A055881(n) <= a(n), and probably also a(n) <= A055874(n).
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.
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.

Crossrefs

Programs

  • Mathematica
    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 *)
  • Scheme
    (define (A232098 n) (A055881 (A000290 n)))

Formula

a(n) = A055881(A000290(n)) = A055881(n^2).
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