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.

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

Original entry on oeis.org

1, 8, 108, 3143, 80404, 5663798, 264709135, 46354321490, 3947286385526, 1938755845909663
Offset: 1

Views

Author

R. H. Hardin, Jan 19 2016

Keywords

Comments

Diagonal of A267667.

Examples

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

Crossrefs

Cf. A267667.