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.

A268206 Number of 2Xn 0..n arrays with every repeated value in every row and column greater than the previous repeated value.

Original entry on oeis.org

4, 81, 3600, 324900, 48441600, 10817248036, 3377332413504, 1404654302923524, 750581746192664100, 501056831514160707984, 408622467650013146382336, 399732806541644129265761569, 461983489514281294192077209856
Offset: 1

Views

Author

R. H. Hardin, Jan 28 2016

Keywords

Comments

Row 2 of A268204.

Examples

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

Crossrefs

Cf. A268204.