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.

A264838 Number of 2Xn 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, 15, 68, 401, 2179, 23229, 213332, 2642772, 38611992, 723385584, 16909827584, 343510569552, 9601049357952, 305917702264416
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Row 2 of A264837.

Examples

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

Crossrefs

Cf. A264837.