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.

A265244 Number of 5Xn arrays containing n copies of 0..5-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0.

Original entry on oeis.org

1, 604, 414716, 327847656, 284341627344, 262625535902888, 253868599216009152, 254001607812847559424, 261073621361948204045280, 274213074180352392981791664
Offset: 1

Views

Author

R. H. Hardin, Dec 06 2015

Keywords

Comments

Row 5 of A265241.

Examples

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

Crossrefs

Cf. A265241.