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

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, 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, 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

Offset

0,12

Links

Winston de Greef, Table of n, a(n) for n = 0..10000

Formula

a(n) = #{k: A008963(k) = 8 and 0<=k<=n};

a(A105508(n)) = a(A105508(n) - 1) + 1;

n = A105511(n) + A105512(n) + A105513(n) + A105514(n) + A105515(n) + A105516(n) + A105517(n) + a(n) + A105519(n).

a(n) ~ log_10(9/8) * n. - Amiram Eldar, Jan 12 2023

Mathematica

Accumulate[Table[If[IntegerDigits[Fibonacci[n]][[1]] == 8, 1, 0], {n, 0, 100}]] (* Amiram Eldar, Jan 12 2023 *)

Prog

(PARI)
(leadingdigit(n, b=10) = n \ 10^logint(n, b));
(isok(n) = leadingdigit(fibonacci(n))==8);
(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

Crossrefs

Cf. A000030, A000045, A008963, A105508.

Cf. A105511, A105512, A105513, A105514, A105515, A105516, A105517, A105519.

Sequence in context: A242259 A048766 A105516 * A111896 A105515 A105514

Adjacent sequences: A105515 A105516 A105517 * A105519 A105520 A105521

Keyword

nonn,base

Author

Reinhard Zumkeller, Apr 11 2005

Status

approved