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.

A264659 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 4, 16, 8, 1, 12, 148, 314, 38, 1, 36, 2400, 20940, 8944, 223, 2, 144, 62800, 3084352, 5911808, 437568, 2412, 4, 576, 2150784, 726042624, 7707842560, 2436623360, 31791360, 26400, 8, 2880, 89051520, 284038382592
Offset: 1

Views

Author

R. H. Hardin, Nov 20 2015

Keywords

Comments

Table starts
.1.....1........2..........4.........12........36..........144......576.2880
.1.....3.......16........148.......2400.....62800......2150784.89051520
.1.....8......314......20940....3084352.726042624.284038382592
.1....38.....8944....5911808.7707842560
.1...223...437568.2436623360
.2..2412.31791360
.4.26400
.8

Examples

			Some solutions for n=3 k=4
..2..0..1..5....8..6.10..5....0.10..7..1....8.10..0.11....2..0..6..5
..8.10..7.11....4..2..0..1...11..5..9..3....9..1..5..7....8.10.11..7
..4..6..3..9....9..7.11..3....2..6..4..8....4..6..2..3....4..3..1..9
		

Crossrefs

Row 1 is A111942(n+1).