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.

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

Original entry on oeis.org

1, 2, 2, 8, 46, 182, 701, 4917, 32687, 241991, 2924430, 40311661, 479980432, 5962660544, 111112429148, 1934811730068
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Column 2 of A264837.

Examples

			All solutions for n=4
..0..7....0..1....0..1....0..7....7..2....0..2....0..7....0..1
..1..2....7..2....7..2....1..2....0..3....7..3....1..3....7..3
..3..4....3..4....5..3....5..3....1..4....1..4....2..4....2..4
..5..6....5..6....6..4....6..4....5..6....5..6....5..6....5..6
		

Crossrefs

Cf. A264837.