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.

A268247 Number of 3Xn 0..n arrays with every repeated value in every row greater than or equal to, and every column greater than, the previous repeated value.

Original entry on oeis.org

6, 576, 216000, 197555340, 371713931400, 1257212773492866, 6967515866907769668, 59102884914387317492904, 728462977173724674571341120, 12523133152298313854607312469836
Offset: 1

Views

Author

R. H. Hardin, Jan 29 2016

Keywords

Comments

Row 3 of A268246.

Examples

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

Crossrefs

Cf. A268246.