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.

A266156 Number of nX2 arrays containing 2 copies of 0..n-1 with no element plus any horizontal, vertical or antidiagonal neighbor equal to n-1.

Original entry on oeis.org

0, 0, 0, 16, 1528, 71328, 10109856, 949116288, 197260755456, 30713652142080, 8957030720294400, 2091857665680783360
Offset: 1

Views

Author

R. H. Hardin, Dec 22 2015

Keywords

Comments

Column 2 of A266158.

Examples

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

Crossrefs

Cf. A266158.