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.

A265375 Number of 5Xn arrays containing n copies of 0..5-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 99, 4954, 363850, 25964546, 2006263350, 159927435847, 13175135914848, 1111064939631727, 95607791613443343, 8362857163936394397
Offset: 1

Views

Author

R. H. Hardin, Dec 07 2015

Keywords

Comments

Row 5 of A265373.

Examples

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

Crossrefs

Cf. A265373.