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 A356758 #19 Aug 10 2024 21:39:05
%S A356758 1,1,1,1,2,2,2,2,3,5,5,6,5,6,9,9,10,11,11,12,12,13,14,18,18,17,19,20,
%T A356758 20,24,24,27,26,29,28,32,32,32,29,35,39,35,39,40,43,44,42,49,48,49,46,
%U A356758 49,50,53,54,56,58,57,62,62,63,58,66,67,70,71,70,73,72,78,81
%N A356758 a(n) is the number of nonzero digits in n!.
%H A356758 Robert G. Wilson v, <a href="/A356758/b356758.txt">Table of n, a(n) for n = 0..10000</a>
%H A356758 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%F A356758 a(n) = A034886(n!) - A027869(n!).
%t A356758 Table[Length[Select[IntegerDigits[n!],Positive]],{n,0,70}]
%o A356758 (PARI) a(n) = #select(x->(x>0), digits(n!)); \\ _Michel Marcus_, Aug 26 2022
%o A356758 (Python)
%o A356758 from math import factorial
%o A356758 def a(n): return len(str(factorial(n)).replace("0", ""))
%o A356758 print([a(n) for n in range(71)]) # _Michael S. Branicky_, Aug 26 2022
%Y A356758 Cf. A000142, A027869, A034886, A356757.
%K A356758 easy,base,nonn
%O A356758 0,5
%A A356758 _Stefano Spezia_, Aug 26 2022