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.

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

Original entry on oeis.org

1, 8, 314, 20940, 3084352, 726042624, 284038382592
Offset: 1

Views

Author

R. H. Hardin, Nov 20 2015

Keywords

Comments

Row 3 of A264659.

Examples

			Some solutions for n=5
..0..2.10..6..5....0.12..6..2.10....0.10..6..1..7....0.10..7..5..1
..8..7.11..3..1....8..7.11.13..5....8..5.11..9.13....4..2.12..6.11
.14.12..4..9.13....4.14..1..9..3....4.12..2.14..3...14..8.13..9..3
		

Crossrefs

Cf. A264659.