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.

A265867 Number of nX2 arrays containing 2 copies of 0..n-1 with no element plus any antidiagonal neighbor equal to n-1.

Original entry on oeis.org

1, 2, 42, 984, 48216, 2869200, 278125200, 31015797120, 4991834736000, 896085889171200, 215916261060729600, 56895400548095155200
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Column 2 of A265870.

Examples

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

Crossrefs

Cf. A265870.