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.

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

Original entry on oeis.org

1, 544, 307016, 196389904, 137409486772, 102117302729744, 79300380540248536, 63677294433618454384
Offset: 1

Views

Author

R. H. Hardin, Nov 29 2015

Keywords

Comments

Row 5 of A264945.

Examples

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

Crossrefs

Cf. A264945.