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.

A264942 Number of nX4 arrays of permutations of 4 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

0, 2, 332, 184740, 196389904, 368696849320, 1122409297218768, 5194172319787113488, 34756519036284839519360
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Column 4 of A264945.

Examples

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

Crossrefs

Cf. A264945.