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.

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

Original entry on oeis.org

24, 11, 45, 259, 2063, 18157, 172169, 1717333, 17555313, 184061791, 1966919505, 21379461151, 235731898917, 2632460173093
Offset: 1

Views

Author

R. H. Hardin, Jan 09 2016

Keywords

Comments

Row 5 of A267019.

Examples

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

Crossrefs

Cf. A267019.