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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Jun 13 2022 03:01:58
%S 5,12,21,30,41,51,62,73,85,97,109,122,134,147,160,174,187,200,214,228,
%T 242,256,270,284,298,312,327,342,356,371,386,401,416,431,446,461,476,
%U 491,507,522,538,553,569,585,600,616,632,648,664,680
%N Smallest m such that Fibonacci(m) >= m^n.
%t Flatten[{5,Table[Ceiling[(n*LambertW[-1,-Log[GoldenRatio]/(n*5^(1/(2*n)))])/-Log[GoldenRatio]],{n,2,50}]}] (* _Vaclav Kotesovec_, Jul 24 2013 *)
%o (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
%Y Cf. A002708, A132634, A132636.
%Y Cf. A065220, A014283.
%K nonn
%O 1,1
%A _Michel Marcus_, Jul 21 2013