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.

A264839 Number of 3 X n arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 2, 22, 409, 4800, 147550, 5692511, 389627606
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Row 3 of A264837.

Examples

			Some solutions for n=4
..2..7..3..8....1..7..8..9...10..0..2..7...10..0..7..2...10..0..2..7
.10..0..4..9...10..0..2..3....3..8..4..9....5..8..4..9....3..8..4..9
..5..1.11..6....5..6.11..4....5..1.11..6....6..1.11..3....5..1..6.11
		

Crossrefs

Cf. A264837.