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.

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.

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

Original entry on oeis.org

1, 8, 59, 743, 17869, 530230, 16961815, 1040174384
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 3 of A264818.

Examples

			Some solutions for n=5
..9..0.14....0.10.14....0..1..7....7..1.14....7.14..8....0.14..8....0..7.10
.10..7..2....7..4..1....9..3.14....0..9..8....9..0..2....1..7..4...14..8.11
..3..8.11....2..5..8...12.10..8...10..5..2....3..1.10...10..2.11....1..2..5
.12..1..4....9.13.11....6.11..2....3..6.11....4..5.11...12..9..5....3..9.12
..6.13..5....3..6.12...13..4..5...12.13..4...12..6.13....6..3.13....6..4.13
		

Crossrefs

Cf. A264818.

A264819 Number of 2Xn 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, 8, 44, 348, 3946, 52524, 1041936, 22648272, 828481536, 26112652416, 1017144989568, 50591916092160
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Row 2 of A264818.

Examples

			Some solutions for n=7
..3..9..0..1..7.11..8...12..9..3..0..7.11..8...12..3..0..9..4..1..7
.12..6.13.10..4..5..2....6.13.10..1..4..5..2....6.13.10..5.11..8..2
		

Crossrefs

Cf. A264818.

A264820 a(n) is the number of 3 X n arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 4, 59, 1644, 83599, 6680669, 731477306
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Row 3 of A264818.

Examples

			Some solutions for n=5:
   9  0 10  7 14    0 12 14 11  8   12  0  7  1  4    9  7  4 14  8
   3  1  4  2  8    7 13 10  4  1   13 14  2  8 11    3  0 12  1 10
  12  6 13  5 11    9  6  3  5  2    6  3  9 10  5    6 13  5  2 11
		

Crossrefs

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