OFFSET
1,2
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..20899
FORMULA
For n>1, a(n) = A072353(n-1) + 1. - Michel Marcus, Jun 01 2014
For n>1, a(n) = ceiling(n*log(10)/log(phi)-log(20)/(2*log(phi))), where phi=(1+sqrt(5))/2, the golden ratio. - Hans J. H. Tuenter, Jul 13 2025
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) a(n)={my(k=1); while(logint(fibonacci(k), 10)<n-1, k++); k} \\ Harry J. Smith, Nov 29 2008
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Shyam Sunder Gupta, Jul 18 2002
STATUS
approved
