A268365 - OEIS

A268365

Number of n X 4 arrays of permutations of 4 copies of 0..n-1 with row sums equal.

1, 36, 2700, 643680, 190188000, 128247235200, 114921318153600, 164433011758848000, 312067875406065408000, 867549791919350615040000, 2986581009309337422259200000

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Column 4 of A268367.

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

Some solutions for n=3

..0..0..2..2....0..2..2..0....1..2..0..1....0..2..0..2....1..1..2..0

..1..1..0..2....0..1..2..1....2..0..2..0....1..1..2..0....0..2..1..1

..2..1..0..1....1..0..1..2....1..2..0..1....1..0..1..2....0..2..0..2

CROSSREFS

Cf. A268367.

Sequence in context: A202633 A198639 A159728 * A004706 A061844 A036510

Adjacent sequences: A268362 A268363 A268364 * A268366 A268367 A268368

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 03 2016

STATUS

approved