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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261602 Triangular array of A(n,k) for n>=1 and 0<=k<=n^2 equal the number of permutations of the set {1,2,...,n}^2 such that first coordinates of first k elements are nondecreasing and second coordinates of the remaining n^2-k elements are nondecreasing. 2
 1, 1, 4, 8, 10, 8, 4, 216, 648, 1188, 1668, 1944, 1944, 1668, 1188, 648, 216, 331776, 1327104, 3151872, 5695488, 8608896, 11446272, 13791744, 15326208, 15858432, 15326208, 13791744, 11446272, 8608896, 5695488, 3151872, 1327104, 331776, 24883200000, 124416000000, 360806400000, 787138560000, 1426595328000, 2262299258880, 3240594432000, 4283587584000, 5304730521600, 6222411878400, 6968709089280, 7493189990400, 7763310604800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A(n,k) = A(n,n^2-k) It is conjectured that A(n,k)>A(n,k-1) for k

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.

Last modified June 24 00:08 EDT 2021. Contains 345403 sequences. (Running on oeis4.)