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.

A264726 Number of nX2 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, 3, 12, 69, 278, 2524, 27024, 250688, 3721984, 56111104, 835883008, 17920733184, 437473529856, 9120031211520, 270263516958720
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2015

Keywords

Comments

Column 2 of A264728.

Examples

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

Crossrefs

Cf. A264728.