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.

A268160 Number of 3Xn arrays containing n copies of 0..3-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.

Original entry on oeis.org

0, 0, 8, 14, 52, 1516, 7582, 46338, 501270, 3535396, 25480614, 220369120, 1716544860, 13279246254, 108919001860, 873463942418, 6971258302462, 56716000746978, 460015101808320, 3726764125840338, 30399952923410062
Offset: 1

Views

Author

R. H. Hardin, Jan 27 2016

Keywords

Comments

Row 3 of A268159.

Examples

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

Crossrefs

Cf. A268159.