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.

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

Original entry on oeis.org

1, 1, 6, 23, 84, 897, 9292, 98776, 1380544, 20573376, 451512320, 8653964800, 238280574976, 6409517629440, 172949221113856
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Column 2 of A264692.

Examples

			Some solutions for n=6
..0..5....0..5....5.11....0..5....0..1....0..1....0..5....6.10...10..1....0..5
.10.11....1.10...10..7....6.10....5.11....5.11....6.10....1..5....5.11....6.10
..6..2....8.11....0..2....7..1...10..2...10..2....1.11....3..0....0..6....1.11
..1..7....3..6....1..8....2.11....6..7....6..7....3..7....8.11....8..2....7..2
..3..8....4..7....6..3....4..8....9..3....3..8....8..2....9..7....4..7....4..8
..9..4....9..2....9..4....9..3....4..8....9..4....9..4....4..2....9..3....9..3
		

Crossrefs

Cf. A264692.