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.

A264710 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 6.

Original entry on oeis.org

1, 1, 8, 84, 800, 15360, 357696, 6873984, 262813248, 12288817152, 432621305856, 28148895055872, 2108257586380800
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Row 2 of A264709.

Examples

			Some solutions for n=6
..6..0..1..7..4.10....0..6..3..9..1..8....6..3..1..4..2..8....6..0.10..4..1..7
..3..9..8..2..5.11....7..4.10.11..2..5....0..9..7.10.11..5....9..3.11..5..2..8
		

Crossrefs

Cf. A264709.