OFFSET
1,2
COMMENTS
LINKS
Hans J. H. Tuenter, Table of n, a(n) for n = 1..10000 (first 1000 terms by Harvey P. Dale)
FORMULA
For n>1, a(n) = floor(floor(n/2)*log(10)/log(phi)+log(5)/(2*log(phi))) + (n mod 2), where phi = (1+sqrt(5))/2 = A001622. - Hans J. H. Tuenter, Sep 09 2025
EXAMPLE
The index value of the smallest ten-digit Fibonacci number is a(19) = 45. The index value of the largest ten-digit Fibonacci number is a(20) = 49.
The first term is the smallest 1-digit Fibonacci number, which is taken to be F(0) = 0, so that the index a(1) = 0. The second term is the largest 1-digit Fibonacci number, which is F(6) = 8, so that the index a(2) = 6. - Hans J. H. Tuenter, Sep 09 2025
MATHEMATICA
Drop[Flatten[{#-1, #}&/@Flatten[Table[Position[IntegerLength[Fibonacci[ Range[250]]], n, 1, 1], {n, 50}]]], {2}](* Harvey P. Dale, Jun 04 2018 *)
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Parthasarathy Nambi, Aug 07 2009
EXTENSIONS
More terms from Harvey P. Dale, Jun 04 2018
Offset changed by Hans J. H. Tuenter, Sep 09 2025
STATUS
approved
