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.

A232158 Number of nX5 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, vertically or antidiagonally, and no adjacent values equal.

Original entry on oeis.org

14, 746, 5902, 46702, 382996, 3183932, 26694774, 223026806, 1869037596, 15673051556, 131274639250, 1100535460668, 9225695626046, 77312726353080, 648103682234572, 5432428499191068, 45531948090605296, 381665246488467802
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2013

Keywords

Comments

Column 5 of A232161

Examples

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