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.

A267637 Number of n X n 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.

Original entry on oeis.org

1, 8, 51, 1015, 8917, 343145, 3696933, 330654951, 4301737251, 1093232460925
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Diagonal of A267644.

Examples

			Some solutions for n=5
..0..1..0..1..0....0..1..0..1..0....0..1..0..1..0....0..1..1..0..1
..1..0..1..0..0....0..1..1..0..0....1..0..0..1..1....1..0..1..0..1
..1..0..0..1..1....1..0..1..0..1....0..1..1..0..0....0..1..0..1..0
..0..1..0..0..1....0..1..0..1..1....0..1..0..0..1....1..0..1..1..0
..1..0..1..0..0....1..0..1..1..0....1..0..1..1..0....1..1..0..0..1
		

Crossrefs

Cf. A267644.