login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088020 a(n) = (n^2)!. 12
1, 1, 24, 362880, 20922789888000, 15511210043330985984000000, 371993326789901217467999448150835200000000, 608281864034267560872252163321295376887552831379210240000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

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

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..21

Index entries for sequences related to tic-tac-toe

MAPLE

seq(factorial(n^2), n=0..10); # Muniru A Asiru, Sep 17 2018

MATHEMATICA

Table[(n^2)!, {n, 0, 9}] (* Vladimir Joseph Stephan Orlovsky, May 19 2011 *)

PROG

(PARI) for(n=0, 10, print1((n^2)!, ", ")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 22 2006

(MAGMA) [Factorial(n^2): n in [0..10]]; // Vincenzo Librandi, May 31 2011

(GAP) List([0..10], n->Factorial(n^2)); # Muniru A Asiru, Sep 17 2018

CROSSREFS

Cf. A000142 (n!), A000290 (n^2).

Cf. A039622, A179268. - Reinhard Zumkeller, Jul 06 2010

Cf. A272094, A272095, A272164.

Sequence in context: A159422 A028371 A013774 * A289746 A289640 A319977

Adjacent sequences:  A088017 A088018 A088019 * A088021 A088022 A088023

KEYWORD

nonn,easy

AUTHOR

Hugo Pfoertner, Sep 18 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 17:37 EDT 2021. Contains 348215 sequences. (Running on oeis4.)