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.

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

Original entry on oeis.org

1, 2, 5, 12, 72, 516, 2727, 29935, 295297, 2830610, 27816612, 288374240, 4410043504, 44410041788, 716533737436, 16424244452552
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Row 2 of A264862.

Examples

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

Crossrefs

Cf. A264862.