login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A292459 a(n) is the smallest number whose factorial has at least n! divisors. 0
0, 0, 2, 4, 6, 9, 12, 16, 20, 26, 31, 38, 43, 52, 59, 67, 74, 83, 93, 103, 111, 123, 134, 146, 157, 167, 179, 193, 203, 218, 229, 241, 258, 271, 283, 301, 313, 331, 347, 359, 379, 393, 409, 422, 440, 457, 469, 488, 504, 523, 543, 563, 577, 597, 614, 631, 651 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The ratio log(a(n))/log(n) reaches a maximum at n=51, where its value is log(563)/log(51) = 1.61077326914...; as n increases, does the ratio approach a limit of 1?
n a(n) log(a(n))/log(n)
====== ======== ================
10 31 1.49136169383...
100 1609 1.60327802204...
1000 41036 1.53772167371...
10000 761879 1.47047150077...
100000 12091591 1.41649668973...
LINKS
EXAMPLE
a(5) = 9 because 9! has 160 (> 120 = 5!) divisors, while 8! has only 96 (< 120).
a(10) = 31 because 31! has 4665600 (> 3628800 = 10!) divisors, while 30! has only 2332800 (< 3628800).
a(100000) = 12091591 because 12091591! has 5.58...*10^456573 (> 2.82...*10^456573 = 100000!) divisors, while 12091590! has only 2.79...*10^456573.
CROSSREFS
Cf. A027423 (Number of positive divisors of n!).
Sequence in context: A194211 A224808 A351719 * A194250 A024610 A022778
KEYWORD
nonn
AUTHOR
Jon E. Schoenfield, Sep 16 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 17:03 EDT 2024. Contains 374322 sequences. (Running on oeis4.)