|
%I #4 Jul 20 2012 04:04:56
%S 1,3,6,9,12,16,20,24,29,34,39,44,49,55,60,66,72,78,84,90,96,103,109,
%T 116,123,129,136,143,150,157,164,172,179,186,194,201,209,216,224,231,
%U 239,247,255,263,271,278,286,295,303,311
%N Least m>0 such that n! <= F(m), the m-th Fibonacci number, A000045(m).
%H Clark Kimberling, <a href="/A214050/b214050.txt">Table of n, a(n) for n = 1..1000</a>
%e a(4) = 9 because F(8) < 4! <= F(9), where F(8) = 13 and F(9) = 21.
%t Table[m=1; While[n!>Fibonacci[m], m++]; m, {n,1,100}]
%Y Cf. A214051.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Jul 18 2012
|
