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.

A266573 Number of 3Xn arrays containing n copies of 0..3-1 with no element 1 greater than its northwest or southwest neighbor modulo 3 and the upper left element equal to 0.

Original entry on oeis.org

2, 5, 15, 109, 574, 2840, 13767, 71646, 390862, 2170370, 11989812, 66094738, 366119221, 2044786962, 11503587136, 65003352026, 368281990242, 2091514533360, 11909843102866, 68009104297282, 389348569168108, 2233795881384252
Offset: 1

Views

Author

R. H. Hardin, Jan 01 2016

Keywords

Comments

Row 3 of A266572.

Examples

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

Crossrefs

Cf. A266572.