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.

A265092 Number of n X n arrays containing n copies of 0..n-1 with row sums equal and column sums equal.

Original entry on oeis.org

1, 2, 12, 4464, 75502080
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2015

Keywords

Comments

Diagonal of A265089.
Cf. Latin squares A002860.

Examples

			Some solutions for n=4
..0..2..1..3....3..3..0..0....3..1..2..0....1..0..2..3....2..1..0..3
..3..1..2..0....0..2..3..1....2..3..1..0....2..3..1..0....3..1..2..0
..0..2..1..3....1..1..1..3....0..2..1..3....1..3..2..0....1..2..3..0
..3..1..2..0....2..0..2..2....1..0..2..3....2..0..1..3....0..2..1..3
		

Crossrefs