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.

A269647 Number of 3Xn arrays containing n copies of 0..3-1 avoiding the pattern down-up in every row and equal-up in every column.

Original entry on oeis.org

6, 74, 574, 4564, 41526, 419516, 4351224, 45696410, 485785550, 5235947490, 57045797346, 626684612988, 6931703318082, 77128097640376, 862658820597866, 9692104806070332, 109322097799502508, 1237402642148758338
Offset: 1

Views

Author

R. H. Hardin, Mar 02 2016

Keywords

Comments

Row 3 of A269646.

Examples

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

Crossrefs

Cf. A269646.