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.

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

Original entry on oeis.org

24, 4, 24, 293, 2063, 18276, 330969, 5977624, 79348962, 830731810, 7878758442, 77839200424, 830249541999, 9547540584128
Offset: 1

Views

Author

R. H. Hardin, Jan 12 2016

Keywords

Comments

Row 5 of A267278.

Examples

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

Crossrefs

Cf. A267278.