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.

A264795 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 3, 15, 130, 1944, 40188, 1149120, 49148112, 2541311040, 156667403520, 11530576378368
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Row 2 of A264794.

Examples

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

Crossrefs

Cf. A264794.