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.

A265119 Number of 4Xn arrays containing n copies of 0..4-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.

Original entry on oeis.org

0, 0, 0, 624, 0, 10110, 0, 300744, 0, 12012024, 0, 606876964, 0, 33691227158, 0, 1960112974014, 0
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2015

Keywords

Comments

Row 4 of A265117.

Examples

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

Crossrefs

Cf. A265117.