|
%I #13 Jan 03 2018 21:39:54
%S 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,
%T 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,
%U 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
%N Number of 0's in decimal expansion of Fibonacci(n).
%H Robert Israel, <a href="/A085854/b085854.txt">Table of n, a(n) for n = 0..10000</a>
%e Fibonacci(15)=610, so a(15)=1 and Fibonacci(44)=701408733, so
%e a(44)=2.
%p seq(numboccur(0, convert(combinat:-fibonacci(n),base,10)), n=0..200); # _Robert Israel_, Jan 03 2018
%t Table[DigitCount[Fibonacci[n]][[10]], {n, 0, 199}] (* _Vladimir Joseph Stephan Orlovsky_, Jul 01 2011 *)
%Y Cf. 1's A085855, 2's A085856, 3's A085857, 4's A085858, 5's A085859, 6's A085860, 7's A085861, 8's A085862, 9's A085863.
%K base,nonn
%O 0,31
%A _Jason Earls_, Jul 06 2003
%E Initial 1 for F(0) = 0 added upon Vladimir Joseph Stephan Orlovsky's comment, Jul 01 2011
%E Corrected by _Robert Israel_, Jan 03 2018
|
