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.

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

Original entry on oeis.org

1, 2, 4, 15, 134, 978, 10370, 114292, 2035620, 29935144, 567866832, 14295267600, 488489391072, 12470564424960
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Row 2 of A264831.

Examples

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

Crossrefs

Cf. A264831.