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.

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.