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.

A268364 Number of (2n-1) X 3 arrays containing 3 copies of 0..2n-2 with row sums equal.

Original entry on oeis.org

1, 216, 116640, 535610880, 3614668001280, 89303801403801600, 2951593617355820236800
Offset: 1

Views

Author

R. H. Hardin, Feb 03 2016

Keywords

Comments

Column 3 of A268367 (odd terms)

Examples

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

Crossrefs

Cf. A268367.