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.

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

Original entry on oeis.org

1, 1, 4, 14, 47, 201, 1331, 11644, 101575, 1079100, 11958564, 169047968, 2375578880, 39413148160, 962468127744, 18758145972224
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 2 of A264818.

Examples

			Some solutions for n=7
..0..8....0..7....9..7....0..7....0..8....0..7....0..7....7..1....0..7....7..8
..7..2....3..1....3..0....3..1....7..1....1..8....1..8....0..8....3..8....0..1
..1..4....4..8...10..1...11..8....9..2...10..2....9..2....3..9...10..1....3..9
..9.11...12..9...11..8....4..2....3.10....3..9....3.10...11..2....5..2....5..2
.10..5....5..2....5..2...12..9...12..4...12..4...12..4....4.10...12..9...12.10
..3.12....6.10...13..4....6.10....6.11....6.11....5.11...12..5...13.11....6.11
..6.13...13.11....6.12...13..5...13..5...13..5....6.13....6.13....6..4...13..4
		

Crossrefs

Cf. A264818.