This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A098842 #12 Jul 19 2020 16:00:04
%S A098842 7,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,
%T A098842 5,4,5,5,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,
%U A098842 4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,5,4,5,5,5,5,4,5,5,5,5,4,5,5,5,4,5,5,5,5
%N A098842 Number of n-digit Fibonacci numbers.
%C A098842 a(1)=7 because the Fibonacci numbers having one digit are the first seven; then the next five have two digits, so a(2)=5.
%H A098842 Reinhard Zumkeller, <a href="/A098842/b098842.txt">Table of n, a(n) for n = 1..1000</a>
%H A098842 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibtable.html">The Fibonacci Numbers</a>.
%H A098842 Ron Knott, <a href="http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormula.html">[Number of digits in Fib(i)] : Calculator</a>.
%t A098842 Join[{7},Rest[Length[#]&/@Split[IntegerLength[Fibonacci[Range[510]]]]]] (* _Harvey P. Dale_, Jul 19 2020 *)
%o A098842 (Haskell)
%o A098842 a098842 n = a098842_list !! (n-1)
%o A098842 a098842_list = map length $ group a060384_list
%o A098842 -- _Reinhard Zumkeller_, Mar 09 2013
%Y A098842 Essentially the same as A050815, which is the main entry for this sequence. Cf. A000045, A060384.
%K A098842 base,easy,nonn
%O A098842 1,1
%A A098842 Alex Vinokur (alexvn(AT)barak-online.net), Nov 03 2004
%E A098842 Corrected by _Alexandre Wajnberg_, Mar 28 2005