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.

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

Original entry on oeis.org

1, 14, 852, 152922, 62038644, 47286888510, 60138461300848
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2016

Keywords

Comments

Column 3 of A269336.

Examples

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

Crossrefs

Cf. A269336.