

A214050


Least m>0 such that n! <= F(m), the mth Fibonacci number, A000045(m).


2



1, 3, 6, 9, 12, 16, 20, 24, 29, 34, 39, 44, 49, 55, 60, 66, 72, 78, 84, 90, 96, 103, 109, 116, 123, 129, 136, 143, 150, 157, 164, 172, 179, 186, 194, 201, 209, 216, 224, 231, 239, 247, 255, 263, 271, 278, 286, 295, 303, 311
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Clark Kimberling, Table of n, a(n) for n = 1..1000


EXAMPLE

a(4) = 9 because F(8) < 4! <= F(9), where F(8) = 13 and F(9) = 21.


MATHEMATICA

Table[m=1; While[n!>Fibonacci[m], m++]; m, {n, 1, 100}]


CROSSREFS

Cf. A214051.
Sequence in context: A084525 A130248 A203302 * A260706 A194199 A072567
Adjacent sequences: A214047 A214048 A214049 * A214051 A214052 A214053


KEYWORD

nonn,easy


AUTHOR

Clark Kimberling, Jul 18 2012


STATUS

approved



