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 A217757 #21 Mar 15 2019 06:53:46 %S A217757 2,4,12,84,2100,254100,183206100,923541950100,37238134969982100, %T A217757 13513011656042074430100,49036030210457135734021310100, %U A217757 1957361459740805606124917565020990100,937579272951542930363610919638075856505150100 %N A217757 Product_{i=0..n} (i! + 1). %H A217757 Alois P. Heinz, <a href="/A217757/b217757.txt">Table of n, a(n) for n = 0..42</a> %F A217757 a(n) ~ c * A000178(n), where c = A238695 = Product_{k>=0} (1 + 1/k!) = 7.364308272367257256372772509631... . - _Vaclav Kotesovec_, Jul 20 2015 %p A217757 a:= proc(n) a(n):= `if`(n=0, 2, a(n-1)*(n!+1)) end: %p A217757 seq(a(n), n=0..14); # _Alois P. Heinz_, May 20 2013 %t A217757 Table[Product[i!+1,{i,0,n}],{n,0,12}] (* _Geoffrey Critzer_, May 04 2013 *) %t A217757 Rest[FoldList[Times,1,Range[0,15]!+1]] (* _Harvey P. Dale_, May 28 2013 *) %o A217757 (JavaScript) %o A217757 function factorial(n) { %o A217757 var i,c=1; %o A217757 for (i=2;i<=n;i++) c*=i; %o A217757 return c; %o A217757 } %o A217757 a=2; %o A217757 for (j=1;j<10;j++) { %o A217757 a*=(factorial(j)+1); %o A217757 document.write(a+", "); %o A217757 } %Y A217757 Cf. A000142, A000178, A054640, A082480, A258325, A260231, A306729. %K A217757 nonn %O A217757 0,1 %A A217757 _Jon Perry_, Mar 23 2013