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.

A265865 Number of 4Xn arrays containing n copies of 0..4-1 with no element plus any vertical neighbor equal to 4-1.

Original entry on oeis.org

8, 384, 22016, 1584088, 124214208, 10318543104, 891453176832, 79282110189528, 7210026166925504, 667397938420086784, 62673274464982136832, 5956095271996318830016, 571751372700932605781504
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Row 4 of A265863.

Examples

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

Crossrefs

Cf. A265863.