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.

A264699 Number of 2Xn 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, 5, 28, 159, 1383, 16818, 168974, 2921624, 43918848, 1166660928, 31828563776, 1193792259072, 43520679101184, 1622694957527040
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Row 2 of A264698.

Examples

			Some solutions for n=6
..0..5..6..2.10.11....0..9..5..1..2..6....0..5.10..6..7.11....8..0..1.10..6..2
..4..8..1..9..7..3....8..4.10.11..7..3....8..4..9..1..2..3....4..5..9.11..7..3
		

Crossrefs

Cf. A264698.