Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Sep 04 2022 12:38:30
%S 0,0,0,0,0,0,2,1,0,0,2,1,0,1,1,1,0,2,1,0,0,2,4,1,2,2,2,6,5,2,3,5,4,2,
%T 5,3,4,6,4,3,8,3,3,4,8,9,6,3,5,9,6,10,9,7,4,11,10,10,8,13,9,5,8,8,11,
%U 7,8,10,13,11,10,12,11,13,13,16,6,16,10,21,17
%N a(n) is the number of zero digits in the product of the first n numbers not divisible by 5.
%F a(n) = A055641(A356858(n)).
%t Table[Count[IntegerDigits[Product[Floor[(5i-1)/4], {i,n}]], 0], {n,0,80}]
%o (Python)
%o from math import prod
%o def a(n): return str(prod((5*k-1)//4 for k in range(1, n+1))).count("0")
%o print([a(n) for n in range(81)]) # _Michael S. Branicky_, Sep 01 2022
%Y Cf. A047201, A055641, A356858.
%Y Cf. A356860 (number of digits), A356861 (number of nonzero digits).
%K nonn,base
%O 0,7
%A _Stefano Spezia_, Sep 01 2022