OFFSET
0,2
COMMENTS
a(n) is also the least positive Fibonacci number whose binary expansion has n+1 digits.
FORMULA
2^n <= a(n) <= A340400(n) < 2^(n+1).
PROG
(PARI) a(n) = for (i=1, oo, my (f=fibonacci(i)); if (f>=2^n, return (f)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jan 06 2021
STATUS
approved