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.

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

Original entry on oeis.org

6, 42, 340, 3136, 30456, 307464, 3182784, 33588630, 359679572, 3896854004, 42621505752, 469855280984, 5214136065200, 58192269283872, 652647993512352, 7351118301680664, 83112561412246944, 942832221757264300
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Row 3 of A265870.

Examples

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

Crossrefs

Cf. A265870.