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.

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.