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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088021 a(n) = (n^2)!/(n!)^2. 10
 1, 1, 6, 10080, 36324288000, 1077167364120207360000, 717579719887926731226850787328000000, 23946596436219275985459662514223331478629410406400000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Based on an observation of Hugo Pfoertner, W. Edwin Clark conjectured and Xiang-dong Hou proved that (n^2)!/(n!)^2 gives the number of distinct determinants of the generic n X n matrix whose entries are n^2 different indeterminates under all (n^2)! permutations of the entries. Using J. T. Schwarz's Sparse Zeros Lemma this implies that for any positive integer n there is an n X n matrix A with positive integer entries such that the set of determinant values obtained from A by permuting the elements of A is (n^2)!/(n!)^2. Moreover, for any entries, no larger number of determinants can be obtained. In fact, by the Sparse Zeros Lemma one can select the entries of A from any sufficiently large subset of real numbers. LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..21 FORMULA a(n) = A088020(n)/A001044(n). PROG (Magma) [Factorial(n^2)/Factorial(n)^2: n in [0..10]]; // Vincenzo Librandi, May 31 2011 CROSSREFS Cf. A001044, A088020. Sequence in context: A172733 A361901 A329911 * A102979 A069942 A261823 Adjacent sequences: A088018 A088019 A088020 * A088022 A088023 A088024 KEYWORD nonn 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 06:07 EDT 2024. Contains 373661 sequences. (Running on oeis4.)