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.

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

Original entry on oeis.org

1, 7, 80, 2051, 59845, 3406328, 233531136, 21272671232
Offset: 1

Views

Author

R. H. Hardin, Nov 21 2015

Keywords

Comments

Column 3 of A264692.

Examples

			Some solutions for n=5
.10..1..5....0..1.10....6.12..0....0..6..5....0.10..7....7.10..5....5.11..2
..0..7.11....6.12..5....8..2..5...10..1..7...11..5..2...12..0..6....0.12..3
..6.12..2...13..7.11...13..7.10...12.11..2...12..1.13....3..1..2...10..7.13
..3..8.14....3..8..2....3..9..1....4.13..8....9..6..3....8.11.14....6..9..8
..9.13..4....9..4.14....4.14.11....9..3.14....4..8.14....9.13..4....1..4.14
		

Crossrefs

Cf. A264692.