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.

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

Original entry on oeis.org

1, 3, 15, 212, 3712, 96256, 3423168, 158521536, 8362014912, 635861560320, 51551078842368
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Row 2 of A264704.

Examples

			Some solutions for n=6
..2..0..8.10..7..1....8..0..6..1..7..3....0..6..4..3..9..7....4..6..8..0..7..9
..4..6..9.11..5..3....4.10..2..5.11..9....8..2.10..5.11..1...10..2.11..5..1..3
		

Crossrefs

Cf. A264704.