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.

A267643 Number of nX7 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

15, 450, 2829, 32303, 128441, 1117207, 3696933, 30649693, 90914453, 784186403, 2141552549, 19980003873, 50876741513, 520249434779, 1246972578665, 13942225071453, 31756214522413, 383944691019691, 839150694697605
Offset: 1

Views

Author

R. H. Hardin, Jan 18 2016

Keywords

Comments

Column 7 of A267644.

Examples

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

Crossrefs

Cf. A267644.