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 A105518 #14 Mar 18 2023 10:36:08
%S A105518 0,0,0,0,0,0,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,
%T A105518 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
%U A105518 4,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7
%N A105518 Number of times 8 is the leading digit of the first n+1 Fibonacci numbers in decimal representation.
%H A105518 Winston de Greef, <a href="/A105518/b105518.txt">Table of n, a(n) for n = 0..10000</a>
%F A105518 a(n) = #{k: A008963(k) = 8 and 0<=k<=n};
%F A105518 a(A105508(n)) = a(A105508(n) - 1) + 1;
%F A105518 n = A105511(n) + A105512(n) + A105513(n) + A105514(n) + A105515(n) + A105516(n) + A105517(n) + a(n) + A105519(n).
%F A105518 a(n) ~ log_10(9/8) * n. - _Amiram Eldar_, Jan 12 2023
%t A105518 Accumulate[Table[If[IntegerDigits[Fibonacci[n]][[1]] == 8, 1, 0], {n, 0, 100}]] (* _Amiram Eldar_, Jan 12 2023 *)
%o A105518 (PARI)
%o A105518 (leadingdigit(n, b=10) = n \ 10^logint(n, b));
%o A105518 (isok(n) = leadingdigit(fibonacci(n))==8);
%o A105518 (lista(n)=my(a=vector(1+n), r=0); for (i=1, n, r+=isok(i); a[1+i]=r); a) \\ _Winston de Greef_, Mar 17 2023
%Y A105518 Cf. A000030, A000045, A008963, A105508.
%Y A105518 Cf. A105511, A105512, A105513, A105514, A105515, A105516, A105517, A105519.
%K A105518 nonn,base
%O A105518 0,12
%A A105518 _Reinhard Zumkeller_, Apr 11 2005