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.

A264641 Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4.

Original entry on oeis.org

1, 1, 6, 30, 284, 2344, 31632, 492432, 12098624, 236007424, 6065647616, 159458086912, 6086725226496, 260007588237312
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2015

Keywords

Comments

Column 2 of A264643.

Examples

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

Crossrefs

Cf. A264643.