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

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

Original entry on oeis.org

1, 5, 21, 259, 5493, 255437, 26320280, 6071784885
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Subdiagonal 1 of A267019.

Examples

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

Crossrefs

Cf. A267020.

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

Original entry on oeis.org

1, 3, 15, 137, 2063, 69265, 4893787, 787556232
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Diagonal of A267019.

Examples

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

Crossrefs

Cf. A267020.

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

Original entry on oeis.org

6, 8, 21, 137, 759, 4835, 31591, 216460, 1516047, 10864196, 79437844, 590119523, 4453596825, 34028591249, 263304258843, 2058154419091, 16252842542358, 129434331448080, 1039407597863960, 8405943746368118, 68447035142972923
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Row 4 of A267019.

Examples

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

Crossrefs

Cf. A267019.

A267021 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 northeast or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 10, 59, 759, 18157, 912057, 100710495
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Superdiagonal 1 of A267019.

Examples

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

Crossrefs

Cf. A267019.

A267022 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 northeast or northwest neighbors modulo n and the upper left element equal to 0.

Original entry on oeis.org

1, 35, 257, 4835, 172169, 13122646, 2166450939
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Superdiagonal 2 of A267019.

Examples

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

Crossrefs

Cf. A267019.

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

Original entry on oeis.org

24, 11, 45, 259, 2063, 18157, 172169, 1717333, 17555313, 184061791, 1966919505, 21379461151, 235731898917, 2632460173093
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Row 5 of A267019.

Examples

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

Crossrefs

Cf. A267019.

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

Original entry on oeis.org

120, 15, 37, 537, 5493, 69265, 912057, 13122646, 193577805, 2965487933, 46310466234
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Row 6 of A267019.

Examples

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

Crossrefs

Cf. A267019.

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

Original entry on oeis.org

720, 19, 147, 1015, 15171, 255437, 4893787, 100710495, 2166450939
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Row 7 of A267019.

Examples

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

Crossrefs

Cf. A267019.
Showing 1-8 of 8 results.