|
|
A105512
|
|
Number of times 2 is the leading digit of the first n+1 Fibonacci numbers in decimal representation.
|
|
10
|
|
|
0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,9
|
|
LINKS
|
|
|
FORMULA
|
a(n) = #{k: A008963(k) = 2 and 0<=k<=n};
|
|
MATHEMATICA
|
Accumulate[Table[If[IntegerDigits[Fibonacci[n]][[1]] == 2, 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))==2);
(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
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|