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.

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

Original entry on oeis.org

1, 400, 1054200, 12243840000, 429355384500000, 39489843246336000000, 7875251932432856328000000, 3103313606339070135803904000000, 2222194400107579127937216888000000000
Offset: 1

Views

Author

R. H. Hardin, Feb 03 2016

Keywords

Comments

Column 6 of A268367.

Examples

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

Crossrefs

Cf. A268367.