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

A267284 Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.

Original entry on oeis.org

6, 5, 24, 137, 1138, 12214, 104742, 741057, 5022782, 35540696, 271621650, 2252475421, 19535278570, 168510129798, 1410939522686, 11518135263919, 93278847927814, 762132469855714, 6339718207407286, 53641859402324039
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Row 4 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 5, 24, 293, 6240, 315356, 33284502
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Subdiagonal 1 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267280 Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 10, 109, 1138, 18276, 663855, 55479601, 12194740046
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Superdiagonal 1 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267281 Number of nX(n+2) arrays of permutations of n+2 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 35, 574, 12214, 330969, 12954512, 912215513
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Superdiagonal 2 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267282 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 126, 2840, 104742, 5977624, 466131976
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Superdiagonal 3 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267283 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 462, 13767, 741057, 79348962, 13687472182
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Superdiagonal 4 of A267278.

Examples

			Some solutions for n=3
..0..0..0..1..2..2..0....0..1..2..0..0..1..2....0..0..1..1..2..2..0
..0..0..1..1..1..2..0....1..1..2..2..0..1..2....0..1..1..2..2..0..0
..2..1..1..1..2..2..2....0..1..2..0..0..1..2....1..0..2..1..2..2..1
		

Crossrefs

Cf. A267278.

A267285 Number of 5 X n arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 5 and the upper left element equal to 0.

Original entry on oeis.org

24, 4, 24, 293, 2063, 18276, 330969, 5977624, 79348962, 830731810, 7878758442, 77839200424, 830249541999, 9547540584128
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Row 5 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267286 Number of 6Xn arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 6 and the upper left element equal to 0.

Original entry on oeis.org

120, 2, 3, 317, 6240, 69265, 663855, 12954512, 466131976, 13687472182, 278976573772
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Row 6 of A267278.

Examples

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

Crossrefs

Cf. A267278.

A267287 Number of 7Xn arrays containing n copies of 0..7-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 7 and the upper left element equal to 0.

Original entry on oeis.org

720, 4, 4, 40, 8724, 315356, 4893787, 55479601, 912215513
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Row 7 of A267278.

Examples

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

Crossrefs

Cf. A267278.
Showing 1-9 of 9 results.