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 A321741 #24 Jan 26 2019 05:07:12
%S A321741 1,1,1,1,2,2,2,6,18,18,18,72,432,1728,1728,1728,8640,86400,864000,
%T A321741 4320000,4320000,4320000,25920000,388800000,7776000000,116640000000,
%U A321741 699840000000,699840000000,699840000000,4898880000000,102876480000000,3600676800000000,126023688000000000,2646497448000000000,18525482136000000000,18525482136000000000
%N A321741 Product of the first n terms of A007318 (Pascal), read as a sequence.
%H A321741 <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F A321741 a(n) = Product_{j=0..n-1} P(n), where P(n) = A007318(n) (as a sequence). - _Wolfdieter Lang_, Jan 25 2019
%e A321741 The 10th term is 18 because the first 10 terms of Pascal's Triangle by row are 1,1,1,1,2,1,1,3,3,1 and 1*1*1*1*2*1*1*3*3*1=18.
%t A321741 FoldList[Times, 1, Rest[Flatten[Table[Binomial[n, k], {n, 0, 7}, {k, 0, n}]]]] (* _Amiram Eldar_, Nov 18 2018 *)
%o A321741 (PARI) lista(nn) = {my(i=0, j=0, p=1); for (n=1, nn, p *= binomial(i, j); print1(p, ", "); j++; if (j > i, j = 0; i++););} \\ _Michel Marcus_, Jan 25 2019
%Y A321741 Cf. A007318, A163866 (partial sums).
%K A321741 nonn,easy
%O A321741 1,5
%A A321741 _Kei Ryan_, Nov 17 2018