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.

A269480 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

4, 54, 574, 6404, 72110, 816583, 9323584, 107089479, 1236171969, 14324836704, 166516037345, 1940477033553, 22659370920439, 265044574417791, 3104569328697374, 36408281098910933, 427405044547342278
Offset: 1

Views

Author

R. H. Hardin, Feb 27 2016

Keywords

Comments

Row 3 of A269479.

Examples

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

Crossrefs

Cf. A269479.