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.

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

Original entry on oeis.org

6, 74, 852, 10210, 124466, 1539739, 19271229, 243392830, 3095718114, 39591108117, 508549674595, 6555349397662, 84743875128342, 1098136390356477, 14258478535216226, 185450173389172712, 2415532450075364094
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2016

Keywords

Comments

Row 3 of A269336.

Examples

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

Crossrefs

Cf. A269336.