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.

A232382 Number of 7Xn 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, diagonally or antidiagonally, and no adjacent values equal.

Original entry on oeis.org

1, 15354, 2324142, 213082596, 22946925502, 2706080691402, 319646954776850, 37494469061522404, 4414758747409076838, 520602557203321831906, 61403145242482284875036, 7242121207883084184401892
Offset: 1

Views

Author

R. H. Hardin, Nov 23 2013

Keywords

Comments

Row 7 of A232376

Examples

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