A085854 Number of 0's in decimal expansion of Fibonacci(n).
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 2, 2, 1, 1, 1, 1, 1, 3, 2, 0, 0, 0, 0, 0, 0, 2, 3, 2, 1, 1, 3, 1, 2, 1, 1, 3, 3, 3, 1, 2, 1, 3, 2, 2, 0, 1, 0, 2, 2, 1, 4, 0, 2, 0, 4, 2, 4, 5, 2, 3, 1, 4, 3, 0, 3, 1, 1, 3, 1, 5, 1
Offset: 0
Examples
Fibonacci(15)=610, so a(15)=1 and Fibonacci(44)=701408733, so a(44)=2.
Links
- Robert Israel, Table of n, a(n) for n = 0..10000
Crossrefs
Programs
-
Maple
seq(numboccur(0, convert(combinat:-fibonacci(n),base,10)), n=0..200); # Robert Israel, Jan 03 2018
-
Mathematica
Table[DigitCount[Fibonacci[n]][[10]], {n, 0, 199}] (* Vladimir Joseph Stephan Orlovsky, Jul 01 2011 *)
Extensions
Initial 1 for F(0) = 0 added upon Vladimir Joseph Stephan Orlovsky's comment, Jul 01 2011
Corrected by Robert Israel, Jan 03 2018