login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A345074 a(n) is the largest integer k such that A345073(k) = n. 1
3, 54, 458, 3480, 25867, 191351, 1414204, 10450027, 77216338 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..10.

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. See p. 10.

PROG

(PARI) f(n) = my(k=1); while (exp(1)*sqrtn(n!, n) >= n+k, k++); k; \\ A345073

lista(nn) = {my(m=2, nm); for (n=2, nn, nm = f(n); if (nm > m, m = nm; print1(n-1, ", ")); ); }

CROSSREFS

Cf. A001113 (e), A345073.

Sequence in context: A275566 A068380 A174782 * A119294 A157541 A182159

Adjacent sequences:  A345071 A345072 A345073 * A345075 A345076 A345077

KEYWORD

nonn,hard,more

AUTHOR

Michel Marcus, Jun 07 2021

EXTENSIONS

Offset changed to 2 and a(8)-a(10) from Jinyuan Wang, Jun 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 13:45 EST 2021. Contains 349563 sequences. (Running on oeis4.)