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.

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

Original entry on oeis.org

1, 8, 888, 359172, 327847656, 559450092072, 1595319525849600, 7039355228926588752, 45427065106451676216288
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Column 4 of A265241.

Examples

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

Crossrefs

Cf. A265241.