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.

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

Original entry on oeis.org

0, 0, 0, 8, 544, 20976, 3124800, 269723136, 61919980032, 9210279970560, 2897383466019840
Offset: 1

Views

Author

R. H. Hardin, Dec 23 2015

Keywords

Comments

Column 2 of A266208.

Examples

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

Crossrefs

Cf. A266208.