|
|
A340399
|
|
a(n) is the least Fibonacci number >= 2^n.
|
|
2
|
|
|
1, 2, 5, 8, 21, 34, 89, 144, 377, 610, 1597, 2584, 4181, 10946, 17711, 46368, 75025, 196418, 317811, 832040, 1346269, 2178309, 5702887, 9227465, 24157817, 39088169, 102334155, 165580141, 433494437, 701408733, 1134903170, 2971215073, 4807526976, 12586269025
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) is also the least positive Fibonacci number whose binary expansion has n+1 digits.
|
|
LINKS
|
|
|
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
|
|
|
STATUS
|
approved
|
|
|
|