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.

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

Original entry on oeis.org

1, 2, 4, 22, 154, 931, 14160, 195952, 2808960, 58924800, 1585406976, 38032879616, 1491624640512, 52205681184768, 2118556421369856
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2015

Keywords

Comments

Row 2 of A264728.

Examples

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

Crossrefs

Cf. A264728.