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!)
A345073 a(n) is the least integer k such that e * (n!)^(1/n) < n + k. 2
2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
David E. Radford, Factorials and powers, a minimality result, arXiv:2106.02002 [math.NT], 2021.
David E. Radford, Factorials and powers, a minimality result, revisited, arXiv:2106.02109 [math.NT], 2021.
PROG
(PARI) a(n) = my(k=1); while (exp(1)*sqrtn(n!, n) >= n+k, k++); k;
CROSSREFS
Cf. A001113 (e), A345074.
Sequence in context: A230516 A192688 A156752 * A086673 A101787 A343607
KEYWORD
nonn
AUTHOR
Michel Marcus, Jun 07 2021
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 March 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)