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.

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.