The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072354 a(n)-th Fibonacci number is the smallest Fibonacci number containing n digits. 12
 1, 7, 12, 17, 21, 26, 31, 36, 40, 45, 50, 55, 60, 64, 69, 74, 79, 84, 88, 93, 98, 103, 107, 112, 117, 122, 127, 131, 136, 141, 146, 151, 155, 160, 165, 170, 174, 179, 184, 189, 194, 198, 203, 208, 213, 217, 222, 227, 232, 237 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..20899 FORMULA For n>1, a(n) = floor(n*c) (+3) or (+2) where c=log(10)/log(Phi) and Phi is the golden ratio = (1+sqrt(5))/2. - Benoit Cloitre, Aug 21 2002 For n>1, a(n) = A072353(n-1) + 1. - Michel Marcus, Jun 01 2014 EXAMPLE a(3) = 12 as the 12th Fibonacci number is the smallest Fibonacci number with 3 digits. MATHEMATICA Flatten[Table[Position[IntegerLength[Fibonacci[Range[250]]], n, {1}, 1], {n, 50}]] (* Harvey P. Dale, Dec 22 2015 *) PROG (PARI) digitsIn(x)=1+log(x)\log(10) {d=0; for(n=1, 100000, x=fibonacci(n); digits = digitsIn(x); if (digits!=d, d = digits; write("b072354.txt", digits, " ", n); ))} \\ Harry J. Smith, Nov 29 2008 CROSSREFS Cf. A105700, A105702, A105703, A105704, A105705, A105706, A105707, A105708, A105709. Sequence in context: A091215 A261410 A090067 * A091576 A272733 A272741 Adjacent sequences:  A072351 A072352 A072353 * A072355 A072356 A072357 KEYWORD base,nonn AUTHOR Shyam Sunder Gupta, Jul 18 2002 STATUS approved

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

Last modified September 25 05:14 EDT 2021. Contains 347652 sequences. (Running on oeis4.)