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.

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

Original entry on oeis.org

1, 3, 24, 316, 6080, 149824, 5728896, 259780608, 14154310656, 1054215834624
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Row 2 of A264560.

Examples

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

Crossrefs

Cf. A264560.