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.

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

Original entry on oeis.org

2, 15, 170, 3089, 106568, 4676432, 252331392, 19898286080
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 3 of A264794.

Examples

			Some solutions for n=5
..2.14..9....0..8..7....9..1..7....0..7..9....2..8.14...14..1..7...14..0..7
.10..0..3...14..1..9...10..8..0....8.14..2....9..1..7....0..9..3....8..3..1
..4..7.11...10..2.11...12..2.14....3..1.11...10..4..0....8.10.11....2.11..9
.12..8..6....3..5.13....6..4..3...10..4..5....5.11..3....2.12..4...10..4..5
..5..1.13....4.12..6...13..5.11....6.12.13...12..6.13....6.13..5...12..6.13
		

Crossrefs

Cf. A264794.