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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A224824 Smallest m such that Fibonacci(m) >= m^n. 0
 5, 12, 21, 30, 41, 51, 62, 73, 85, 97, 109, 122, 134, 147, 160, 174, 187, 200, 214, 228, 242, 256, 270, 284, 298, 312, 327, 342, 356, 371, 386, 401, 416, 431, 446, 461, 476, 491, 507, 522, 538, 553, 569, 585, 600, 616, 632, 648, 664, 680 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..50. MATHEMATICA Flatten[{5, Table[Ceiling[(n*LambertW[-1, -Log[GoldenRatio]/(n*5^(1/(2*n)))])/-Log[GoldenRatio]], {n, 2, 50}]}] (* Vaclav Kotesovec, Jul 24 2013 *) PROG (PARI) a(n) = {my(ok = 0, m = 2); until (ok, if (fibonacci(m) >= m^n, ok = 1, m++); ); return (m); } \\ Michel Marcus, Jul 21 2013; corrected Jun 13 2022 CROSSREFS Cf. A002708, A132634, A132636. Cf. A065220, A014283. Sequence in context: A270214 A063559 A259913 * A121291 A272012 A272451 Adjacent sequences: A224821 A224822 A224823 * A224825 A224826 A224827 KEYWORD nonn AUTHOR Michel Marcus, Jul 21 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 05:37 EST 2023. Contains 367575 sequences. (Running on oeis4.)