cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A224824 Smallest m such that Fibonacci(m) >= m^n.

This page as a plain text file.
%I A224824 #20 Jun 13 2022 03:01:58
%S A224824 5,12,21,30,41,51,62,73,85,97,109,122,134,147,160,174,187,200,214,228,
%T A224824 242,256,270,284,298,312,327,342,356,371,386,401,416,431,446,461,476,
%U A224824 491,507,522,538,553,569,585,600,616,632,648,664,680
%N A224824 Smallest m such that Fibonacci(m) >= m^n.
%t A224824 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 A224824 (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 A224824 Cf. A002708, A132634, A132636.
%Y A224824 Cf. A065220, A014283.
%K A224824 nonn
%O A224824 1,1
%A A224824 _Michel Marcus_, Jul 21 2013