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 A061603 #20 Dec 06 2024 21:43:48
%S A061603 1,1,1,1,1,1,1,1,1,1,3628800,39916800,239500800,1037836800,3632428800,
%T A061603 10897286400,29059430400,70572902400,158789030400,335221286400,
%U A061603 1216451004088320000,25545471085854720000,281000181944401920000,2154334728240414720000
%N A061603 a(n) = n! / {product of factorials of the digits of n}.
%C A061603 It can be shown that the terms obtained by the above formula are positive integers using the fact that k! divides a product of k consecutive numbers.
%H A061603 Harry J. Smith, <a href="/A061603/b061603.txt">Table of n, a(n) for n = 0..100</a>
%F A061603 a(n) = A000142(n)/A066459(n). - _Michel Marcus_, Jul 02 2018
%e A061603 a(12) = (12!) / (1!*2!) = 239500800.
%t A061603 Table[n!/Times@@(IntegerDigits[n]!),{n,0,30}] (* _Harvey P. Dale_, Jan 19 2017 *)
%o A061603 (PARI) a(n) = my(d = digits(n)); n!/prod(k=1, #d, d[k]!); \\ _Michel Marcus_, Jul 02 2018
%Y A061603 Cf. A000142, A061602, A066459.
%K A061603 nonn,base,easy
%O A061603 0,11
%A A061603 _Amarnath Murthy_, May 19 2001
%E A061603 Corrected and extended by _Vladeta Jovovic_, May 19 2001