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.

A264693 Number of 2Xn 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, 7, 56, 348, 4672, 93864, 1776576, 42654496, 1464068352, 62669138688, 2416965949440, 119518360215552
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Row 2 of A264692.

Examples

			Some solutions for n=6
..0.10..4..1.11..5....6.10..8.11..5..2....6..0..9.10.11..5....0..1.11..5..2..8
..6..3..9..7..8..2....9..0..3..1..4..7....3..1..4..7..2..8....6..9..3.10..7..4
		

Crossrefs

Cf. A264692.