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.

A268072 Number of nX5 0..3 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

39, 30295, 18691624, 12341773443, 7496016439865, 4526538615127374, 2650602668970910839, 1532388103026197724943, 872365742087350348504945
Offset: 1

Views

Author

R. H. Hardin, Jan 25 2016

Keywords

Comments

Column 5 of A268073.

Examples

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

Crossrefs

Cf. A268073.