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.

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

Original entry on oeis.org

1, 3, 8, 38, 223, 2412, 26400, 371328, 5636096, 92242944, 2278149120, 57145347072, 1607327566848, 49562666560512
Offset: 1

Views

Author

R. H. Hardin, Nov 20 2015

Keywords

Comments

Column 2 of A264659.

Examples

			Some solutions for n=5
..0..5....5..1....6..5....0..1....0..5....6..0....0..5....0..2....6..5....5..7
..2..1....0..6....2..0....5..7....1..7....1..5....6..8....5..7....8..0....0..8
..8..6....3..7....7..1....6..2....6..3....7..3....1..3....1..3....3..1....1..3
..9..7....8..2....8..4....4..8....2..8....2..8....2..4....6..8....9..7....6..4
..4..3....4..9....3..9....9..3....4..9....4..9....7..9....4..9....4..2....2..9
		

Crossrefs

Cf. A264659.