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.

A264943 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

0, 1, 2350, 11375145, 137409486772, 3537141103745065, 173357342638694530002, 14844736259829478729001905
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Column 5 of A264945.

Examples

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

Crossrefs

Cf. A264945.