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.

Showing 1-4 of 4 results.

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.

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

Original entry on oeis.org

1, 2, 22, 271, 2703, 61692, 1521328, 77111451, 3285347994
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Column 3 of A264837.

Examples

			Some solutions for n=4
..0..7..9....0..7..8....0..7..2...10..0..9....0..2..7....7..3..8....0..1..7
..2..8..3...10..1..2....3..8..9...11..7..2....1..3..8....0.11..1....8..4..9
.11..1..4....3..4..9...10..1.11....5..8..3....5.10..9....2..4..9...10.11..2
..5.10..6....5..6.11....5..6..4....6..1..4....6.11..4...10..5..6....5..6..3
		

Crossrefs

Cf. A264837.

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.

A264839 Number of 3 X n arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 2, 22, 409, 4800, 147550, 5692511, 389627606
Offset: 1

Views

Author

R. H. Hardin, Nov 26 2015

Keywords

Comments

Row 3 of A264837.

Examples

			Some solutions for n=4
..2..7..3..8....1..7..8..9...10..0..2..7...10..0..7..2...10..0..2..7
.10..0..4..9...10..0..2..3....3..8..4..9....5..8..4..9....3..8..4..9
..5..1.11..6....5..6.11..4....5..1.11..6....6..1.11..3....5..1..6.11
		

Crossrefs

Cf. A264837.
Showing 1-4 of 4 results.