The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227052 a(n) = (n^2)! / (n^2-n)! = number of ways of placing n labeled balls into n^2 labeled boxes with at most one ball in each box. 0
 1, 1, 12, 504, 43680, 6375600, 1402410240, 432938943360, 178462987637760, 94670977328928000, 62815650955529472000, 50963773003971232204800, 49633807532904958383820800, 57141374006987657125324185600, 76763145767753986733306290176000, 119005648371962652004288345681920000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..15. MATHEMATICA Table[(n^2)!/(n^2-n)!, {n, 0, 20}] (* Harvey P. Dale, Aug 10 2017 *) PROG (Python) import math for n in range(20): print str(math.factorial(n*n)/math.factorial(n*n-n))+', ', CROSSREFS Cf. A014062. Sequence in context: A220258 A220322 A279302 * A176731 A211085 A197600 Adjacent sequences: A227049 A227050 A227051 * A227053 A227054 A227055 KEYWORD nonn,easy AUTHOR Alex Ratushnyak, Jun 29 2013 STATUS approved

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

Last modified August 3 21:27 EDT 2024. Contains 374905 sequences. (Running on oeis4.)