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.

A232375 Number of nX7 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

48, 19448, 2046700, 219597458, 24945468636, 2824295623804, 319646954776850, 36234058732024820, 4107330198377776652, 465585399247158982768, 52778440824390526548132, 5982947009339446194736266
Offset: 1

Views

Author

R. H. Hardin, Nov 23 2013

Keywords

Comments

Column 7 of A232376

Examples

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