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.

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

Original entry on oeis.org

2, 22, 152, 1462, 13772, 139144, 1431824, 15086614, 161254844, 1745205892, 19070813984, 210091931944, 2330150737904, 25993622086384, 291414635747552, 3281265369826774, 37087677409301804, 420618333874721044
Offset: 1

Views

Author

R. H. Hardin, Dec 17 2015

Keywords

Comments

Row 3 of A265863.

Examples

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

Crossrefs

Cf. A265863.