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.

A221433 Number of nX3 1..(max n,3) arrays with each row and column having unrepeated values.

Original entry on oeis.org

6, 12, 12, 576, 66240, 15321600, 5411750400, 2834466324480, 2102110586634240, 2130686007341875200, 2866934087721639936000, 4998512704699099643904000, 11064050379110706817558118400, 30552674703715743883429360435200
Offset: 1

Views

Author

R. H. Hardin Jan 16 2013

Keywords

Comments

Column 3 of A221438.

Examples

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

References

  • RJ Stones, S Lin, X Liu, G Wang, On Computing the Number of Latin Rectangles, Graphs and Combinatorics, Graphs and Combinatorics (2016) 32:1187-1202; DOI 10.1007/s00373-015-1643-1

Crossrefs

Cf. A221438.