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.

A267665 Number of nX6 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

11, 242, 5324, 60401, 624476, 5663798, 49212395, 413258400, 3417993766, 28026084373, 228941114008, 1868432655976, 15254571685815, 124714040038344, 1021298776008550, 8379613096399389, 68885791116415104, 567383480583996940
Offset: 1

Views

Author

R. H. Hardin, Jan 19 2016

Keywords

Comments

Column 6 of A267667.

Examples

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

Crossrefs

Cf. A267667.