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 A069468 #10 Mar 25 2020 15:59:03
%S A069468 0,1,3,17,68,807,5310,121536,2775630,48782385,0,0,0,0,0,0,0,0,0,0,0,0,
%T A069468 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A069468 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A069468 Number of ways writing n! as a product of some other numbers which has no digits equal to 1.
%F A069468 a(n) = A067734(n!) = A067734(A000142(n)).
%F A069468 a(n) = 0 if n>10 since A068184 and A067185 are complete sequences.
%e A069468 n=4, 4!=24, A067734(24)=17 and the 17 solutions are as follows: {38,46,64,83,226,234,243,262,324,342,423,432,622,2223,2232,2322,3222}.
%Y A069468 Cf. A067734, A000142, A068183, A068185.
%K A069468 base,nonn
%O A069468 1,3
%A A069468 _Labos Elemer_, Mar 25 2002
%E A069468 More terms from _Max Alekseyev_, Sep 19 2009