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.

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

Original entry on oeis.org

1, 1, 1, 2, 4, 8, 24, 72, 216, 864, 3456, 13824, 69120, 345600, 1728000, 10368000, 62208000, 373248000, 2612736000, 18289152000, 128024064000, 1024192512000, 8193540096000, 65548320768000, 589934886912000, 5309413982208000, 47784725839872000
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Column 1 of A264560.

Examples

			All solutions for n=4
..0....3
..3....0
..1....1
..2....2

Links

Crossrefs

Cf. A264560.
Column k=3 of A275062.

Programs

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

Formula

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

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

Original entry on oeis.org

1, 3, 15, 156, 2032, 30912, 737280, 19491840, 585019584, 26539425792, 1275815411712, 65050879721472
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Column 2 of A264560.

Examples

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

Crossrefs

Cf. A264560.

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

Original entry on oeis.org

2, 24, 888, 58368, 7019136, 1202698368
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Column 3 of A264560.

Examples

			Some solutions for n=4
..0..6..3....9..1..3...10..6..3....6..0..3....9..7..3....3.11..9....6..0.10
.10..4..9....0..4..2....7..9..1....1..5..9....0..4..6....6..8..0....3..9..7
..1..7..5....6..7.11....4..0..5....4..8..7...10..2..8....7..5..1....5.11..1
..2..8.11...10..8..5....8..2.11...10..2.11....1..5.11...10..2..4....8..2..4

Crossrefs

Cf. A264560.

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

Original entry on oeis.org

1, 3, 24, 316, 6080, 149824, 5728896, 259780608, 14154310656, 1054215834624
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Row 2 of A264560.

Examples

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

Crossrefs

Cf. A264560.

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

Original entry on oeis.org

1, 15, 888, 84672, 17444160, 5356808640, 2800372248576
Offset: 1

Views

Author

R. H. Hardin, Nov 17 2015

Keywords

Comments

Row 3 of A264560.

Examples

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

Crossrefs

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.