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.

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.