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.

A269334 Number of nX2 arrays containing 2 copies of 0..n-1 avoiding the pattern equal-up in every row and column.

Original entry on oeis.org

1, 6, 74, 1880, 80316, 5141864, 458608016, 54247835568, 8210406468580, 1546786612196152, 354873066291138768
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2016

Keywords

Comments

Column 2 of A269336.

Examples

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

Crossrefs

Cf. A269336.