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.

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

Original entry on oeis.org

2, 16, 314, 8944, 437568, 31791360, 3066123264
Offset: 1

Views

Author

R. H. Hardin, Nov 20 2015

Keywords

Comments

Column 3 of A264659.

Examples

			Some solutions for n=5
..0..5..1....0..7..5....0.11..5....0.11..5....0..1..5....0..2..6....0..2..5
.10..6.11...10.12.11...10.12..1...10..6.13...10..6.12...10.12.11...10.12.11
.12..2..7....6.14..8....8..2..6....7..1..3...11..7..3....5..7.13....6..3..7
.13..3..9....1..9..3....9..3..7...12..2..8....2..9.13....1..3..9....1..9.13
.14..8..4....2..4.13...14..4.13...14..4..9....8..4.14...14..8..4....8..4.14
		

Crossrefs

Cf. A264659.