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.

A253161 Number of (n+1)X(3+1) 0..2 arrays with every 2X2 subblock sum differing from its neighbors horizontally, vertically and nw-se diagonally.

Original entry on oeis.org

3844, 46752, 555842, 7252320, 92998506, 1190692584, 15179218714, 194198939906, 2482220834294, 31740256495626, 405683545431502, 5186473593590730, 66301707444606534, 847604837440730462, 10835407210226372002
Offset: 1

Views

Author

R. H. Hardin, Dec 28 2014

Keywords

Comments

Column 3 of A253164

Examples

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