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-5 of 5 results.

A264791 Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 384, 1152, 3456, 10368, 31104, 93312, 279936, 1119744, 4478976, 17915904, 71663616, 286654464, 1146617856, 4586471424, 22932357120, 114661785600, 573308928000, 2866544640000, 14332723200000, 71663616000000
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 1 of A264794.

Examples

			All solutions for n=11
..0....0....7....0....7....0....7....7....7....7....0....0....0....7....0....7
..7....7....0....7....0....7....0....0....0....0....7....7....7....0....7....0
..1....1....8....8....8....1....1....8....1....8....8....8....8....1....1....1
..8....8....1....1....1....8....8....1....8....1....1....1....1....8....8....8
..9....2....2....9....9....2....9....2....2....9....9....2....2....9....9....2
..2....9....9....2....2....9....2....9....9....2....2....9....9....2....2....9
..3....3...10....3....3...10...10....3...10...10...10...10....3....3...10....3
.10...10....3...10...10....3....3...10....3....3....3....3...10...10....3...10
..4....4....4....4....4....4....4....4....4....4....4....4....4....4....4....4
..5....5....5....5....5....5....5....5....5....5....5....5....5....5....5....5
..6....6....6....6....6....6....6....6....6....6....6....6....6....6....6....6
		

Crossrefs

Cf. A264794.
Column k=7 of A275062.

Programs

  • Mathematica
    Table[Product[Floor[(n + i)/7]!, {i, 0, 6}], {n, 1, 40}] (* Vaclav Kotesovec, Oct 02 2018 *)

Formula

a(n) = Product_{i=0..6} floor((n+i)/7)!. - Alois P. Heinz, Jul 12 2016
a(n) ~ (2*Pi*n)^3 * n! / 7^(n + 7/2). - Vaclav Kotesovec, Oct 02 2018

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

Original entry on oeis.org

1, 3, 6, 23, 112, 561, 3519, 39132, 437312, 4828352, 70006528, 1118710784, 17726058496, 298648682496, 7527505969152
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 2 of A264794.

Examples

			Some solutions for n=7
..0..7....7..1....0..8....9..7....0..8....8..0....7..1....0..8....8..7....7..1
..1..9....0..8....7..1....2..0....7..3....2..7....0..8....7..1....2..0....0..9
..8..3....9..3...10..2....4..8....1.11....4..1....2..3....2..9...10..1....8.10
..2.11....2..4....3..9...11..1....2.12....5..9....9.11....3.11....3..9....2..3
.10.12...10.11....4.12...12.10....9..5...12.10...10.12...10..5....4.11...12..4
..4..6...12..6...11..5....6..3...10..6...13..3....4..6....4..6...13..5....6.11
..5.13....5.13....6.13...13..5....4.13....6.11....5.13...12.13....6.12...13..5
		

Crossrefs

Cf. A264794.

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

Original entry on oeis.org

2, 15, 170, 3089, 106568, 4676432, 252331392, 19898286080
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Column 3 of A264794.

Examples

			Some solutions for n=5
..2.14..9....0..8..7....9..1..7....0..7..9....2..8.14...14..1..7...14..0..7
.10..0..3...14..1..9...10..8..0....8.14..2....9..1..7....0..9..3....8..3..1
..4..7.11...10..2.11...12..2.14....3..1.11...10..4..0....8.10.11....2.11..9
.12..8..6....3..5.13....6..4..3...10..4..5....5.11..3....2.12..4...10..4..5
..5..1.13....4.12..6...13..5.11....6.12.13...12..6.13....6.13..5...12..6.13
		

Crossrefs

Cf. A264794.

A264795 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 3, 15, 130, 1944, 40188, 1149120, 49148112, 2541311040, 156667403520, 11530576378368
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Row 2 of A264794.

Examples

			Some solutions for n=6
..8..2..0..4..9..7...10..0..2..8..4..1....2..4..0..1..3..7....8..0..1..7..3..9
..6.10..3..5.11..1....6..7..9..3.11..5...10..6..8..9..5.11....4..6.10..2..5.11
		

Crossrefs

Cf. A264794.

A264796 Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 7.

Original entry on oeis.org

1, 6, 170, 9656, 1369408, 275062400, 89203565824
Offset: 1

Views

Author

R. H. Hardin, Nov 25 2015

Keywords

Comments

Row 3 of A264794.

Examples

			Some solutions for n=4
..0..8.11..7....0..2..8..7....8..0..3..7....0..2..8..7....0..1..9..7
..9..1..5..3...10..9..1.11....1..9.11..5...11..5..1..9....4..8.10..2
..2.10..6..4....6..4..3..5...10..2..4..6....4..6.10..3....6.11..5..3
		

Crossrefs

Cf. A264794.
Showing 1-5 of 5 results.