|
%I #12 Jan 09 2021 11:06:42
%S 1,2,5,8,21,34,89,144,377,610,1597,2584,4181,10946,17711,46368,75025,
%T 196418,317811,832040,1346269,2178309,5702887,9227465,24157817,
%U 39088169,102334155,165580141,433494437,701408733,1134903170,2971215073,4807526976,12586269025
%N a(n) is the least Fibonacci number >= 2^n.
%C a(n) is also the least positive Fibonacci number whose binary expansion has n+1 digits.
%F 2^n <= a(n) <= A340400(n) < 2^(n+1).
%o (PARI) a(n) = for (i=1, oo, my (f=fibonacci(i)); if (f>=2^n, return (f)))
%Y Cf. A000045, A000079, A340400.
%K nonn
%O 0,2
%A _Rémy Sigrist_, Jan 06 2021
|
