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.

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

Original entry on oeis.org

0, 2, 2, 30, 58, 588, 2388, 17456, 102874, 731154, 5027962, 36610288, 266876496, 1982397806, 14796809106, 111298650288, 840466993090, 6372988144620, 48466708273020, 369602842446350, 2824995007935614, 21637397279211678
Offset: 1

Views

Author

R. H. Hardin, Jan 20 2016

Keywords

Comments

Row 3 of A267724.

Examples

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

Crossrefs

Cf. A267724.