cp's OEIS Frontend

A105511 Number of times 1 is the leading digit of the first n+1 Fibonacci numbers in decimal representation.

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