This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232098 a(n) = largest m such that m! divides n^2; a(n) = A055881(n^2). 9


%S 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 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 1,2,1,4,1,2,1,2,1,3,1,2,1,2,1,4,1,2,1

%N a(n) = largest m such that m! divides n^2; a(n) = A055881(n^2).

%C For all n, A055881(n) <= a(n), and probably also a(n) <= A055874(n).

%C 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 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 Antti Karttunen, <a href="/A232098/b232098.txt">Table of n, a(n) for n = 1..10080</a>

%F a(n) = A055881(A000290(n)) = A055881(n^2).

%o (Scheme)

%o (define (A232098 n) (A055881 (A000290 n)))

%Y Cf. A055881, A055874, A055926, A232096, A232099, A233267.

%K nonn

%O 1,2

%A _Antti Karttunen_, Nov 18 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 20:53 EDT 2019. Contains 323534 sequences. (Running on oeis4.)