login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(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
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10080

FORMULA

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

PROG

(Scheme)

(define (A232098 n) (A055881 (A000290 n)))

CROSSREFS

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

Sequence in context: A257993 A055881 A204917 * A055874 A195155 A178544

Adjacent sequences:  A232095 A232096 A232097 * A232099 A232100 A232101

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 18 2013

STATUS

approved

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 April 18 06:48 EDT 2019. Contains 322209 sequences. (Running on oeis4.)