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.

A268362 Number of n X n arrays containing n copies of 0..n-1 with row sums equal.

Original entry on oeis.org

1, 4, 216, 643680, 269568000000, 39489843246336000000, 2716675055795577271091911200000, 130980129445039212210880200374052628780800000
Offset: 1

Views

Author

R. H. Hardin, Feb 03 2016

Keywords

Comments

Diagonal of A268367.

Examples

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

Crossrefs

Cf. A268367.