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 A369523 #23 Feb 21 2024 14:42:23
%S A369523 1,12,120960,5230697472000,3102242008666197196800000,
%T A369523 61998887798316869577999908025139200000000,
%U A369523 86897409147752508696036023331613625269650404482744320000000000,15860866523235520512929173666895185100358189521818149024850236796901838028800000000000000
%N A369523 a(n) = n*(n^2 - 1)!.
%C A369523 a(n) is the number of ways to fill an n X n square matrix with n^2 distinct elements such that a chosen element is in a designated row (or alternatively a column).
%F A369523 a(n) = (n^2)!/n.
%F A369523 a(n) = Integral_{x>=0} x^(n - 1)*exp(-x^(1/n)) dx.
%p A369523 seq(n*factorial(n^2-1), n=1..8);
%t A369523 Table[n*(n^2-1)!, {n, 1, 8}]
%o A369523 (PARI) a(n) = n*(n^2-1)!
%Y A369523 Cf. A088020, A179268.
%K A369523 nonn,easy
%O A369523 1,2
%A A369523 _Thomas Scheuerle_, Jan 25 2024