The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Sequence in context: A087077 A200276 A168081 * A117647 A121568 A276464
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jan 06 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 07:28 EDT 2024. Contains 372760 sequences. (Running on oeis4.)