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 A135396 #26 Nov 27 2021 20:03:50
%S A135396 1,1,2,12,24,17280,720,87091200,29030400,1755758592000,3628800,
%T A135396 1525930675524002119680000000,479001600,15033074749223731200000,
%U A135396 151533393472175210496000000,2201737050440244933006930739200000000
%N A135396 a(n) = Product_{d|n} (n-d)!.
%H A135396 G. C. Greubel, <a href="/A135396/b135396.txt">Table of n, a(n) for n = 1..100</a>
%F A135396 If p prime, a(p) = (p-1)!. - _Bernard Schott_, Nov 15 2021
%e A135396 For n = 6, the divisors of 6 are 1,2,3,6; a(6) = (6-1)! * (6-2)! * (6-3)! * (6-6)! = 17280.
%p A135396 A135396 := proc(n) local dvs ; dvs := numtheory[divisors](n) minus {n} ; mul( (n-i)!,i=dvs) ; end: seq(A135396(n),n=1..30) ; # _R. J. Mathar_, Feb 19 2008
%t A135396 Table[Product[(n - Divisors[n][[i]])!, {i,1,Length[Divisors[n]]}], {n, 1, 20}] (* _Stefan Steinerberger_, Feb 19 2008 *)
%t A135396 Table[Times@@((n-Divisors[n])!),{n,20}] (* _Harvey P. Dale_, Dec 10 2014 *)
%o A135396 (PARI) a(n)=my(s=1); fordiv(n,d, s*=(n-d)!); s \\ _Charles R Greathouse IV_, Oct 12 2016
%Y A135396 Cf. A000142.
%Y A135396 Cf. A000010 (comments on product formulas).
%K A135396 easy,nonn
%O A135396 1,3
%A A135396 _Ctibor O. Zizka_, Feb 17 2008
%E A135396 Definition simplified by _Stefan Steinerberger_, Feb 19 2008
%E A135396 More terms from _R. J. Mathar_ and _Stefan Steinerberger_, Feb 19 2008