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.

A268424 Number of 4Xn 0..3 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

14, 2530, 467899, 92967597, 17282463434, 3197637400309, 577216284723410, 103129350712869051, 18199468798597838146, 3185845262388985273409, 553601961042772734126748, 95663189554686667773844253
Offset: 1

Views

Author

R. H. Hardin, Feb 04 2016

Keywords

Comments

Row 4 of A268423.

Examples

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

Crossrefs

Cf. A268423.