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.

A267915 Number of 4Xn 0..2 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

13, 938, 43972, 2331981, 104491831, 4817531571, 207508204575, 8960112001163, 375426257575299, 15673406360156331, 644971612069289479, 26434347183210422659, 1075438596218448452443, 43616300555346348016639
Offset: 1

Views

Author

R. H. Hardin, Jan 22 2016

Keywords

Comments

Row 4 of A267911.

Examples

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

Crossrefs

Cf. A267911.