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.

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

Original entry on oeis.org

6, 22, 88, 296, 1372, 6128, 29552, 147570, 755512, 3945876, 21025260, 113229974, 617874744, 3397997370, 18844357820, 105109392654, 589660050052, 3322222401602, 18796006629928, 106695843736852, 607569787629568
Offset: 1

Views

Author

R. H. Hardin, Dec 23 2015

Keywords

Comments

Row 3 of A266183.

Examples

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

Crossrefs

Cf. A266183.