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.

A265873 Number of 5Xn arrays containing n copies of 0..5-1 with no element plus any antidiagonal neighbor equal to 5-1.

Original entry on oeis.org

120, 48216, 28645840, 21193260208, 17674408924672, 15911293963416432, 15104600670382197568, 14910000118066989160848, 15165975804512559467456384, 15797283250644652058312904312, 16775470633279853447117524943968
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Row 5 of A265870.

Examples

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

Crossrefs

Cf. A265870.