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.

A265240 Number of n X 5 arrays of permutations of 5 copies of 0..n-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 16, 8880, 29189088, 284341627344, 6395116792255680, 285689982691389531024
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Column 5 of A265241.

Examples

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

Crossrefs

Cf. A265241.