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.

A264712 Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 6.

Original entry on oeis.org

1, 2, 2, 11, 94, 365, 2891, 30242, 207653, 2119577, 19807006, 218836016, 3149604508, 57791376424, 900430886016, 25428213982688
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Column 2 of A264714.

Examples

			Some solutions for n=6
..6..1....6..8....6..7....0..1....6..1....0..8....0..7....6..7....6..2....0..7
..0..7....0..2....0..1....6..8....0..8....6..2....6..8....0..8....0..8....6..2
..2..9....1..9....2..8....7..2....7..9....7..9....1..9....1..9....7..9....1..3
..8..3....7..3....4..9...10..9....2..3....1..3....2..3....2..3....1..3....8..9
..5.10....5.10...11..3...11..3...11..4...11..4....5.10...11..4...11..4...10..4
.11..4...11..4....5.10....5..4....5.10....5.10...11..4....5.10....5.10....5.11
		

Crossrefs

Cf. A264714.