|
%I #34 Sep 08 2022 08:45:11
%S 1,1,24,362880,20922789888000,15511210043330985984000000,
%T 371993326789901217467999448150835200000000,
%U 608281864034267560872252163321295376887552831379210240000000000
%N a(n) = (n^2)!.
%C a(n) is the number of ways in which is possible to fill an n X n square matrix with n^2 distinct elements. - _Stefano Spezia_, Sep 16 2018
%H Vincenzo Librandi, <a href="/A088020/b088020.txt">Table of n, a(n) for n = 0..21</a>
%H <a href="/index/Th#TTT">Index entries for sequences related to tic-tac-toe</a>
%p seq(factorial(n^2),n=0..10); # _Muniru A Asiru_, Sep 17 2018
%t Table[(n^2)!,{n,0,9}] (* _Vladimir Joseph Stephan Orlovsky_, May 19 2011 *)
%o (PARI) for(n=0,10,print1((n^2)!,",")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006
%o (Magma) [Factorial(n^2): n in [0..10]]; // _Vincenzo Librandi_, May 31 2011
%o (GAP) List([0..10],n->Factorial(n^2)); # _Muniru A Asiru_, Sep 17 2018
%Y Cf. A000142 (n!), A000290 (n^2).
%Y Cf. A039622, A179268. - _Reinhard Zumkeller_, Jul 06 2010
%Y Cf. A272094, A272095, A272164.
%K nonn,easy
%O 0,3
%A _Hugo Pfoertner_, Sep 18 2003
| 