This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A165753 #11 Jan 10 2020 13:04:50
%S A165753 0,0,0,0,1,1,2,4,7,13,20,34,56,93,150,244,396,643,1043,1689,2733,4425,
%T A165753 7161,11587,18754,30344,49100,79449,128552,208007,336563,544573,
%U A165753 881140,1425715,2306860,3732583,6039449,9772038,15811490,25583533,41395029
%N A165753 Number of trailing zeros in sequence of factorials of Fibonacci numbers.
%C A165753 a(n) is the number of zeros at rightmost place of F(n)!
%D A165753 C. Suriano, Miniature Matematiche, Il rosone, 2009, pp. 149-152.
%H A165753 Harvey P. Dale, <a href="/A165753/b165753.txt">Table of n, a(n) for n = 1..1000</a>
%F A165753 a(n) = A027868(A000045(n))
%F A165753 a(n) = k * phi^n + O(n), for k = 1/sqrt(80).
%e A165753 F(7)!=13!=6227020800 which ends with 2 zeros; therefore a(7)=2.
%t A165753 zOF[n_Integer?Positive]:=Module[{maxpow=0},While[5^maxpow<=n,maxpow++];Plus@@Table[Quotient[n,5^i],{i,maxpow-1}]];zOF[#]&/@ Fibonacci[ Range[ 50]] (* _Harvey P. Dale_, Jan 10 2020 *)
%K A165753 nonn
%O A165753 1,7
%A A165753 _Carmine Suriano_, Sep 26 2009
%E A165753 Extended and edited by _Charles R Greathouse IV_, Mar 23 2010