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.

A264696 Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 4 and columns nondecreasing modulo 5.

Original entry on oeis.org

1, 2, 3, 22, 93, 790, 7202, 53884, 640932, 7175700, 150597632, 3323171712, 92150022336, 2899990063360, 72285872321536
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Column 2 of A264698.

Examples

			Some solutions for n=6
..5.11....0..1....0..1....0..5....5..1....0..5....5.10....5.10....0.11....5.10
..0..6...10.11....5.11...10..6...10.11....6.10....0.11....0.11...10..6....0..6
.10..2....5..6...10..6...11..7....0..6....7.11....6..2....1..6....5..1....8..1
..1..7....8..2....8..7....1..2....8..7....8..1....1..7....2..7....3..7....3.11
..4..8....4..7....4..2....9..3....4..2....9..2....4..8....8..3....9..2....4..2
..9..3....9..3....9..3....4..8....9..3....4..3....9..3....4..9....4..8....9..7
		

Crossrefs

Cf. A264698.