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.

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

Original entry on oeis.org

186624, 4189216, 92998506, 2461955138, 62954425188, 1612778665632, 40892835737758, 1045243631714532, 26655995880836874, 680590803725411114, 17356137926136738110, 442903594404834251862, 11300064205772118129666
Offset: 1

Views

Author

R. H. Hardin, Dec 28 2014

Keywords

Comments

Column 5 of A253164

Examples

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