cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

R. H. Hardin, Feb 03 2016

Keywords

Comments

Column 4 of A268367.

Examples

			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.