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 A068184 #18 Dec 21 2015 17:15:32
%S A068184 1,1,2,6,38,358,2589,25789,257889,2578879,45578899
%N A068184 Smallest number whose product of digits equals n!.
%C A068184 The sequence is finite because n! for n>10 has 2-digit prime factors.
%e A068184 For n=4 the solutions having digit products equal 24 excluding those with digit 1 are: {38, 46, 64, 83, 226, 234, 243, 262, 324, 342, 423, 432, 622, 2223, 2232, 2322, 3222} of which the smallest is 38. For n>1, numbers with a digit 1 are too big.
%Y A068184 Cf. A000142, A001222, A002473, A067734, A068183-A068187, A068189-A068191.
%K A068184 base,fini,nonn,full
%O A068184 0,3
%A A068184 _Labos Elemer_, Feb 18 2002
%E A068184 Edited by _Henry Bottomley_, Feb 26 2002