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.

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

Original entry on oeis.org

24, 1880, 152922, 13745475, 1301306034, 128342085219, 13047193985189, 1357312565492416, 143782288933148993, 15453753021813989744
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2016

Keywords

Comments

Row 4 of A269336.

Examples

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

Crossrefs

Cf. A269336.